Spanning tree packing number and eigenvalues of graphs with given girth

DOI10.1016/J.LAA.2019.05.022MaRDI QIDQ2321370zbMATH OpenOpenAlexWikidataFDO

Authors Hong-Jian Lai, Yingzhi Tian, Rui-fang Liu

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

zbMATH Keywords

eigenvaluegirthedge-disjoint spanning treesedge-connectivityspanning tree packing numberquotient matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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

Cites work

• scientific article; zbMATH DE number 5161643 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• scientific article; zbMATH DE number 3046496 (Why is no real title available?)
• Bounds of the number of disjoint spanning trees
• Connectivity and edge-disjoint spanning trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-connectivity and (signless) Laplacian eigenvalue of graphs
• Edge-connectivity and edge-disjoint spanning trees
• Edge-disjoint spanning trees and eigenvalues
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• Eigenvalues and edge-connectivity of regular graphs
• Graph clustering
• Graph theory
• Interlacing eigenvalues and graphs
• Note on edge-disjoint spanning trees and eigenvalues
• On the Problem of Decomposing a Graph into n Connected Factors
• On the spanning tree packing number of a graph: A survey
• Optimal attack and reinforcement of a network
• Spectra of graphs
• The multi-tree approach to reliability in distributed networks

Cited in

(14)

• Connectivity and eigenvalues of graphs with given girth or clique number
• Vertex-connectivity and eigenvalues of graphs with fixed girth
• Lattices over Bass rings and graph agglomerations
• Spectral radius and edge‐disjoint spanning trees
• Fractional matching number and spectral radius of nonnegative matrices of graphs
• Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
• Fractional spanning tree packing, forest covering and eigenvalues
• 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
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• 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)