Cores and Independence Numbers of Grassmann Graphs
Cores and Independence Numbers of Grassmann Graphs
复制标题
DOI：
10.1007/s00373-017-1858-4
复制
发表时间：
2017-10
影响因子：
0.7
通讯作者：
Liping Huang;Benjian Lv
中科院分区：
文献类型：
--
作者：
Liping Huang;Benjian Lv
一个图G是一个核，如果G的每一个自同态是一个自同构。设为参数为sq，m，n的格拉斯曼图。我们证明了许多Grassmann图是核，而和都不是核。我们还得到了的独立数。在进一步研究核和编码理论时，估计核的独立数的上界是非常重要的。利用的点传递子图，我们得到了的独立数的上界，这也是Etzion和Vardy在2011年的论文中对常维码大小的界的改进。
A graphGis a core if every endomorphism ofGis an automorphism. Letbe the Grassmann graph with parametersq,m,n. We prove that many Grassmann graphs are cores, and bothandare not cores. We also obtain the independence number of. In further to study cores and coding theory, it is important to estimate the upper bound of the independence number of. Using a vertex-transitive subgraph of, we obtain upper bounds on the independence number of, which are also an improvement of bounds for the size of constant dimension codes in a 2011 paper of Etzion and Vardy.