首页> 外文期刊>Ars Combinatoria: An Australian-Canadian Journal of Combinatorics >On the Q-index and index of triangle-free quasi-tree graphs
【24h】

On the Q-index and index of triangle-free quasi-tree graphs

机译:关于无三角形拟树图的Q指数和指数

获取原文
获取原文并翻译 | 示例
       

摘要

A connected graph G is called a quasi-tree graph, if there exists v(0) is an element of V (G) such that G - v(0) is a tree. In this paper, among all triangle-free quasi-tree graphs of order n with G - v(0) being a tree and d(v(0)) = d(0), we determine the maximal and the second maximal signless Laplacian spectral radii together with the corresponding extremal graphs. By an analogous manner, we obtained similar results on the spectral radius of triangle-free quasi-tree graphs.
机译:如果存在v(0)是V(G)的元素,使得G-v(0)是树,则连通图G称为准树图。在本文中,在所有阶数为n且G-v(0)为树且d(v(0))= d(0)的无三角形拟树图中,我们确定了最大和第二个最大无符号拉普拉斯算子光谱半径以及相应的极值图。通过类似的方式,我们在无三角准树图的谱半径上获得了相似的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号