Spectral radius and edge‐disjoint spanning trees
From MaRDI portal
Publication:6084711
DOI10.1002/jgt.22996arXiv2207.04701MaRDI QIDQ6084711
Huiqiu Lin, Dandan Fan, Xiaofeng Gu
Publication date: 6 November 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.04701
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Cites Work
- Unnamed Item
- Fractional spanning tree packing, forest covering and eigenvalues
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- Packing spanning trees in highly essentially connected graphs
- Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity
- A sharp upper bound of the spectral radius of graphs
- On the spectral radius of graphs with cut edges
- Spectral conditions for graph rigidity in the Euclidean plane
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees
- Note on edge-disjoint spanning trees and eigenvalues
- Spanning tree packing number and eigenvalues of graphs with given girth
- On circular flows of graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- Optimal attack and reinforcement of a network
- On (k,d)-colorings and fractional nowhere-zero flows
- Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
- Rigidity of Frameworks Supported on Surfaces
- A Characterization of Generically Rigid Frameworks on Surfaces of Revolution
- Decomposition of Finite Graphs Into Forests
- On the spanning tree packing number of a graph: A survey
- Spectral radius conditions for the rigidity of graphs
