On the reduced signless Laplacian spectrum of a degree maximal graph

doi:10.1016/j.laa.2009.11.031

淡江大學機構典藏 > 理學院 > 應用數學與數據科學學系 > 期刊論文 > Item 987654321/58766

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/58766

题名:	On the reduced signless Laplacian spectrum of a degree maximal graph
作者:	Tam, Bit-Shun;Wu, Shu-Hui
贡献者:	淡江大學數學學系
关键词:	Degree maximal graph;Reduced signless Laplacian;Signless Laplacian spectrum;Characteristic polynomial;Neighborhood equivalence class
日期:	2010-03-15
上传时间:	2011-10-01 21:09:37 (UTC+8)
出版者:	Philadelphia: Elsevier Inc.
摘要:	For a (simple) graph G, the signless Laplacian of G is the matrix A(G)+D(G), where A(G) is the adjacency matrix and D(G) is the diagonal matrix of vertex degrees of G; the reduced signless Laplacian of G is the matrix Δ(G)+B(G), where B(G) is the reduced adjacency matrix of G and Δ(G) is the diagonal matrix whose diagonal entries are the common degrees for vertices belonging to the same neighborhood equivalence class of G. A graph is said to be (degree) maximal if it is connected and its degree sequence is not majorized by the degree sequence of any other connected graph. For a maximal graph, we obtain a formula for the characteristic polynomial of its reduced signless Laplacian and use the formula to derive a localization result for its reduced signless Laplacian eigenvalues, and to compare the signless Laplacian spectral radii of two well-known maximal graphs. We also obtain a necessary condition for a maximal graph to have maximal signless Laplacian spectral radius among all connected graphs with given numbers of vertices and edges.
關聯:	Linear Algebra and its Applications 432(7), pp.1734-1756
DOI:	10.1016/j.laa.2009.11.031
显示于类别:	[應用數學與數據科學學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
0024-3795_432(7)p1734-1756.pdf		313Kb	Adobe PDF	264	检视/开启
0024-3795_432(7)p1734-1756.pdf		313Kb	Adobe PDF	1	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章

数据加载中.....