arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.05274math.CO
收藏

关于极小笼图的距离谱及伴随的距离双正则图

On the distance spectrum of minimal cages and associated distance biregular graphs

Aditi Howlader, Pratima Panigrahi

摘要:

$(k,g)$ -笼是围长为$g$且顶点数最少的$k$ -正则简单图。本文将Moore图的$(k,g)$ -笼称为极小$(k,g)$ -笼.如果一个简单的连通图的所有顶点具有相同的交集数组,则该图称为距离正则图(DR)。一个二部图称为距离双正则图(DBR),如果同一部集的所有顶点都允许同一个交数组。已知极小$(k,g)$ -笼是DR图,其子图是DBR图.本文对极小$(k,g)$ -笼给出了距离谱半径的一个公式,并确定了图的直径$g$次多项式.当变量被邻接特征值代替时,该多项式给出所有的距离特征值。我们证明了直径为$d$的极小$(k,g)$ -笼具有$d+1$不同的距离特征值,这部分地回答了[5]中提出的一个问题.证明了每一个DBR图都是一个$2$ -分块的透射正则图,并给出了它的距离谱半径的计算公式。利用这个公式,我们得到了极小$(k,g)$ -笼的细分距离谱半径.最后确定了某些极小$(k,g)$ -笼的细分的全距离谱。

英文摘要:

A $(k,g)$-cage is a $k$-regular simple graph of girth $g$ with minimum possible number of vertices. In this paper, $(k,g)$-cages which are Moore graphs are referred as minimal $(k,g)$-cages. A simple connected graph is called distance regular(DR) if all its vertices have the same intersection array. A bipartite graph is called distance biregular(DBR) if all the vertices of the same partite set admit the same intersection array. It is known that minimal $(k,g)$-cages are DR graphs and their subdivisions are DBR graphs. In this paper, for minimal $(k,g)$-cages we give a formula for distance spectral radius in terms of $k$ and $g$, and also determine polynomials of degree $[\frac{g}{2}]$, which is the diameter of the graph. This polynomial gives all distance eigenvalues when the variable is substituted by adjacency eigenvalues. We show that a minimal $(k,g)$-cage of diameter $d$ has $d+1$ distinct distance eigenvalues, and this partially answers a problem posed in [5]. We prove that every DBR graph is a $2$-partitioned transmission regular graph and then give a formula for its distance spectral radius. By this formula we obtain the distance spectral radius of subdivision of minimal $(k,g)$-cages. Finally we determine the full distance spectrum of subdivision of some minimal $(k,g)$-cages.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑