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

DOI10.1016/J.DISC.2024.113927MaRDI QIDQ6204344FDOQ6204344

Authors Sizhong Zhou, Zhiren Sun, Hongxia Liu

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

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

Recommendations

• Characterizing spanning trees via the size or the spectral radius of graphs
• Spectral radius and spanning trees of graphs
• Spanning trees with constraints on the leaf degree
• Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs

Cites work

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

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204344)