Eigenvalue conditions implying edge-disjoint spanning trees and a forest with constraints
From MaRDI portal
Cites work
- A sharp upper bound of the spectral radius of graphs
- An extension of Nash-Williams and Tutte's theorem
- Commutativity and spectra of Hermitian matrices
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
- Extensions of matroid covering and packing
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees
- Interlacing eigenvalues and graphs
- Merging the \(A\)- and \(Q\)-spectral theories
- Note on edge-disjoint spanning trees and eigenvalues
- On spanning tree packings of highly edge connected graphs
- On the \(\alpha\)-index of graphs with pendent paths
- On the Problem of Decomposing a Graph into n Connected Factors
- On the spanning tree packing number of a graph: A survey
- On the α-spectral radius of graphs
- Packing spanning trees in highly essentially connected graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spanning tree packing and 2-essential edge-connectivity
- Spectra of graphs
- Spectral radius and edge‐disjoint spanning trees
Cited in
(1)
This page was built for publication: Eigenvalue conditions implying edge-disjoint spanning trees and a forest with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884435)
