【摘 要】
:
Each code can be characterized as an independent set of a graph or a hypergraph.By applying some results on the lower bound of independent number, we improve th
论文部分内容阅读
Each code can be characterized as an independent set of a graph or a hypergraph.By applying some results on the lower bound of independent number, we improve the lower bounds of permutation code, perfect hash family, frameproof code and separable code under some parameters respectively.
其他文献
We survey some of our results in spectral graph theory, including some aspects on adjacency, Laplacian, signless Laplacian and distance spectra.
It is difficult to detect and evaluate the number of communities in complex networks, especially when the situation involves an ambiguous boundary between the i
本刊讯 日前,司法部相关负责人介绍,各试点地区和部门认真贯彻落实党中央、国务院关于“减证便民”的改革部署,简化了办事创业的流程和材料,需要提供的证明材料越来越少,企业
I will introduce two types of code design problems of some practical interest in understanding complexities of dependencies in relational database systems.One p
一日省人民委员会发布关于在农村中建立义务乡邮站的指示,要求今冬明春在湘潭、常德、邵阳三专区的各县的40%的乡、其它各县20%至30%的乡建立义务乡邮站,1956年争取全省60%
A parameter is locally if it involves an induced subgraph of G that is isomorphic to a given graph H (for example, minimum degree, and so on); global, otherwise
本刊讯 日前,财政部表示,为更好发挥高校毕业生基层服务项目示范引领作用,引导和鼓励更多高校毕业生到基层工作,近日,财政部、人社部印发《关于做好2020年高校毕业生“三支一
Let Fn denote the nth Fibonacci number and Ln denote the nth Lucas number.Melham conjectured that for any n, m ≥ 1, the sum L1L3L5 … L2m+1 Σr=1 F2m2r+1can be
Graph coloring is an old subject with many important applications.Variants of graph coloring are not only important in their various applications, but also they