D-index and Q-index for spanning trees with leaf degree at most k in graphs
From MaRDI portal
Publication:6204344
Recommendations
Cites work
- 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 {P2, P5}-factor in a graph
- Eigenvalues and [a,b]‐factors in regular graphs
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- 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 \(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
- 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
(20)- 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_-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
- Spectral conditions for path-factors in isolated tough graphs
- Some results on the k-strong parity property in a graph
- Spanning subgraphs and spectral radius in graphs
- Some sufficient conditions for graphs to have component factors
- A spectral condition for the existence of component factors in graphs
- A distance spectral radius for star-factors with large components in graphs
- Toughness, fractional extendability and distance spectral radius in graphs
- Tight conditions for spanning trees with leaf degree at most k in graphs
- Some spectral conditions for star-factors in bipartite graphs
- Sufficient conditions for even factors in graphs
- A result on spanning trees with bounded total excess
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)
