首页> 外文期刊>Electronic Journal Of Combinatorics >The Signless Laplacian Spectral Radius of Unicyclic and Bicyclic Graphs with a Given Girth
【24h】

The Signless Laplacian Spectral Radius of Unicyclic and Bicyclic Graphs with a Given Girth

机译:给定周长的单圈和双圈图的无符号拉普拉斯谱半径

获取原文
           

摘要

Let $mathcal{U}(n,g)$ and $mathcal{B}(n,g)$ be the set of unicyclic graphs and bicyclic graphs on $n$ vertices with girth $g$, respectively. Let $mathcal{B}_{1}(n,g)$ be the subclass of $mathcal{B}(n,g)$ consisting of all bicyclic graphs with two edge-disjoint cycles and $mathcal{B}_{2}(n,g)=mathcal{B}(n,g)ackslashmathcal{B}_{1}(n,g)$. This paper determines the unique graph with the maximal signless Laplacian spectral radius among all graphs in $mathcal{U}(n,g)$ and $mathcal{B}(n,g)$, respectively. Furthermore, an upper bound of the signless Laplacian spectral radius and the extremal graph for $mathcal{B}(n,g)$ are also given.
机译:令$ mathcal {U}(n,g)$和$ mathcal {B}(n,g)$分别为围长为$ g $的$ n $顶点上的单环图和双环图的集合。令$ mathcal {B} _ {1}(n,g)$为$ mathcal {B}(n,g)$的子类,它由具有两个边不相交的循环的所有双环图和$ mathcal {B } _ {2}(n,g)= 数学{B}(n,g)反斜杠数学{B} _ {1}(n,g)$。本文确定分别在$ mathcal {U}(n,g)$和$ mathcal {B}(n,g)$中的所有图中具有最大无符号拉普拉斯谱半径的唯一图。此外,还给出了无符号拉普拉斯频谱半径的上限和$ mathcal {B}(n,g)$的极值图。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号