\(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs

DOI10.1016/J.DISC.2024.113927MaRDI QIDQ6204344

Hongxia Liu, Si-zhong Zhou, Zhi-ren Sun

Publication date: 27 March 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

graphspanning tree\(\mathcal{D}\)-index\(\mathcal{Q}\)-index

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Related Items (9)

Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ Sufficient conditions for a graph \(kG\) admitting all \([1, k\)-factors] ⋮ Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs ⋮ Independence number and minimum degree for path-factor critical uniform graphs ⋮ On the \(A_\alpha\)-index of graphs with given order and dissociation number ⋮ Star-factors with large components, fractional \(k\)-extendability and spectral radius in graphs ⋮ Characterizing spanning trees via the size or the spectral radius of graphs ⋮ A spectral condition for component factors in graphs ⋮ An odd \([1, b\)-factor in a graph from signless Laplacian spectral radius]

Cites Work

• Unnamed Item
• Unnamed Item
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• Spanning trees with bounded degrees
• On the spectrum of an equitable quotient matrix and its application
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Some results on path-factor critical avoidable graphs
• An odd \([ 1 , b \)-factor in regular graphs from eigenvalues]
• Spectral radius and matchings in graphs
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Two sufficient conditions for odd \([1,b\)-factors in graphs]
• Some sufficient conditions for path-factor uniform graphs
• On the distance signless Laplacian spectral radius of graphs
• Matrix Analysis
• On k-orthogonal factorizations in networks
• Merging the A-and Q-spectral theories
• Isolated toughness for path factors in networks
• The existence of path-factor uniform graphs with large connectivity
• The spanning k-trees, perfect matchings and spectral radius of graphs
• Spanning trees with many leaves
• A sufficient condition for a graph to have a \(k\)-tree
• Spanning trees with constraints on the leaf degree
• Eigenvalues and [a,b‐factors in regular graphs]
• Degree conditions for the existence of a {P₂, P₅}-factor in a graph

This page was built for publication: \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs