Edge-disjoint spanning trees and eigenvalues of graphs

DOI10.1016/J.LAA.2013.08.041MaRDI QIDQ2435485zbMATH OpenOpenAlexFDO

Authors Guo-Jun Li, Lingsheng Shi

Publication date 19 February 2014

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2013.08.041

zbMATH Keywords

connectivityedge-disjointeigenvaluespanning tree

Mathematics Subject Classification ID

Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42)

Recommendations

• Edge-disjoint spanning trees and eigenvalues
• Note on edge-disjoint spanning trees and eigenvalues
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Extremal graphs for a spectral inequality on edge-disjoint spanning trees

Cites work

• 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
• Eigenvalues and edge-connectivity of regular graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Spectra of graphs

Cited in

(29)

• Vertex-connectivity and eigenvalues of graphs with fixed girth
• Extremal graphs for a spectral inequality on edge-disjoint spanning trees
• Connectivity and eigenvalues of graphs with given girth or clique number
• Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
• On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
• Note on edge-disjoint spanning trees and eigenvalues
• Vertex-connectivity and eigenvalues of graphs
• Spanning tree packing number and eigenvalues of graphs with given girth
• Edge-disjoint spanning trees and eigenvalues
• Edge-disjoint spanning trees for the generalized butterfly networks and their applications
• Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
• Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• On edge-disjoint spanning trees with small depths
• Fractional spanning tree packing, forest covering and eigenvalues
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• scientific article; zbMATH DE number 1043869 (Why is no real title available?)
• On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
• Edge connectivity, packing spanning trees, and eigenvalues of graphs
• scientific article; zbMATH DE number 5499264 (Why is no real title available?)
• Spectral radius and edge‐disjoint spanning trees
• Edge-disjoint spanning trees and balloons in (multi-)graphs from size or spectral radius
• Spectral radius and edge-disjoint spanning trees of graphs with prescribed edge connectivity
• Eigenvalues and factors: a survey
• Spectral radius, edge connectivity and edge-disjoint spanning tree in bipartite graphs
• Connectivity, spanning tree packing number and signless Laplacian spectral radius
• Edge-disjoint spanning trees, eigenvalues, and size of graphs
• Spectral conditions for edge connectivity and packing spanning trees in multigraphs

This page was built for publication: Edge-disjoint spanning trees and eigenvalues of graphs

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