D-index and Q-index for spanning trees with leaf degree at most k in graphs

Let G be a connected graph and let k be a positive integer. Let T be a spanning tree of G. The leaf degree of a vertex v∈V(T) is defined as the number of leaves adjacent to v in T. The leaf degree of T is the maximum leaf degree among all the vertices of T. Let D(G) and Q(G) denote the distance matr...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 347; no. 5; p. 113927
Main Authors Zhou, Sizhong, Sun, Zhiren, Liu, Hongxia
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.05.2024
Subjects
[formula omitted]-index
Graph
Spanning tree
Graph
Q-index
D-index
Spanning tree
Online AccessGet full text

Cover

More Information
Summary:Let G be a connected graph and let k be a positive integer. Let T be a spanning tree of G. The leaf degree of a vertex v∈V(T) is defined as the number of leaves adjacent to v in T. The leaf degree of T is the maximum leaf degree among all the vertices of T. Let D(G) and Q(G) denote the distance matrix and the distance signless Laplacian matrix of G, respectively. In this work, we provide the upper bounds for the spectral radius of D(G) (resp. Q(G)) in a connected graph G of order n to guarantee that G contains a spanning tree with leaf degree at most k. Furthermore, we establish some extremal graphs to show all the upper bounds obtained in this work are sharp.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2024.113927