Spanning tree packing number and eigenvalues of graphs with given girth
DOI10.1016/J.LAA.2019.05.022zbMATH Open1419.05130OpenAlexW2947185854WikidataQ127821108 ScholiaQ127821108MaRDI QIDQ2321370FDOQ2321370
Hong-Jian Lai, Rui-fang Liu, Yingzhi Tian
Publication date: 29 August 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.05.022
Recommendations
- Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
- Note on edge-disjoint spanning trees and eigenvalues
- Vertex-connectivity and eigenvalues of graphs with fixed girth
- Fractional spanning tree packing, forest covering and eigenvalues
- Edge-disjoint spanning trees and eigenvalues
eigenvaluegirthedge-disjoint spanning treesedge-connectivityspanning tree packing numberquotient matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Graph clustering
- Title not available (Why is that?)
- Spectra of graphs
- Interlacing eigenvalues and graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge-connectivity and edge-disjoint spanning trees
- The multi-tree approach to reliability in distributed networks
- Bounds of the number of disjoint spanning trees
- Edge-disjoint spanning trees and eigenvalues of graphs
- 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
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- Optimal attack and reinforcement of a network
- On the spanning tree packing number of a graph: A survey
- Eigenvalues and edge-connectivity of regular graphs
- Connectivity and edge-disjoint spanning trees
Cited In (11)
- Connectivity and eigenvalues of graphs with given girth or clique number
- Spectral radius and edge‐disjoint spanning trees
- Lattices over Bass rings and graph agglomerations
- Fractional matching number and spectral radius of nonnegative matrices of graphs
- 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\)
- \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs
- The maximum number of spanning trees of a graph with given matching number
- Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
- Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
- Edge connectivity, packing spanning trees, and eigenvalues of graphs
This page was built for publication: Spanning tree packing number and eigenvalues of graphs with given girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321370)
