On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs

Author:

Shang Yilun

Abstract

Abstract As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G. In this paper we obtain a closed-form formula for the enumeration of spanning trees in Г(G), employing the theory of electrical networks. We present bounds for the largest and second smallest Laplacian eigenvalues of Г(G) in terms of the maximum degree, the number of edges, and the first Zagreb index of G. In addition, we establish upper and lower bounds for the Laplacian Estrada index of Г(G) based on the vertex degrees of G. These bounds are also connected with the number of spanning trees in Г(G).

Publisher

Walter de Gruyter GmbH

Subject

General Mathematics

Reference16 articles.

1. - perfect codes in Sierpiński graphs - perfect codes in Sierpinski graphsBull;Klavžar;Bull Austral Math Soc Austral Math Soc,2002

2. Sierpiński graphs as spanning subgraphs of Hanoi graphs Sierpiński graphs as spanning subgraphs of Hanoi graphsCent;Hinz;Cent Eur J Math Eur Math,2013

3. On the number of spanning trees of a multi - complete / star related graph On the number of spanning trees of a multi - complete / star related graphInform;Chung;Inform Process Lett Process Lett,2000

4. Clique graphs of time graphs Clique graphs of time graphsJ;Hedman;Ser Combin Th Ser,1984

5. The first Zagreb index years after MATCH Commun The first Zagreb index years afterMATCH Commun;Gutman;Math Comput Chem Ch Math Comput Chem,2004

Cited by 24 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3