中文

带号图的秩关于围长的表示

组合数学 2021-09-08 v1

摘要

Γ=(G,σ)\Gamma=(G,\sigma) 为带号图,A(G,σ)A(G,\sigma) 为其邻接矩阵。记 gr(G)gr(G)GG 的围长,即 GG 中最短圈的长度。令 r(G,σ)r(G,\sigma)(G,σ)(G,\sigma) 的秩。本文将证明对带号图 (G,σ)(G,\sigma)r(G,σ)gr(G)2r(G,\sigma)\geq gr(G)-2。此外,我们刻画了满足等式 r(G,σ)=gr(G)2r(G,\sigma)=gr(G)-2r(G,σ)=gr(G)r(G,\sigma)=gr(G) 的所有极值图。

关键词

引用

@article{arxiv.2109.02830,
  title  = {The rank of a signed graph in terms of girth},
  author = {Yong Lu and Qi Wu},
  journal= {arXiv preprint arXiv:2109.02830},
  year   = {2021}
}

备注

13 pages, 1 figure