Spanning tree packing number and eigenvalues of graphs with given girth

DOI10.1016/j.laa.2019.05.022zbMath1419.05130OpenAlexW2947185854WikidataQ127821108 ScholiaQ127821108MaRDI QIDQ2321370

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

eigenvaluespanning tree packing numbergirthedge-connectivityedge-disjoint spanning treesquotient matrix

Mathematics Subject Classification ID

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

Related Items (9)

Fractional matching number and spectral radius of nonnegative matrices of graphs ⋮ Lattices over Bass rings and graph agglomerations ⋮ Spectral radius and edge‐disjoint spanning trees ⋮ Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs ⋮ 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\) ⋮ The maximum number of spanning trees of a graph with given matching number ⋮ Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Graph clustering
• Spectra of graphs
• Edge-connectivity and edge-disjoint spanning trees
• Eigenvalues and edge-connectivity of regular graphs
• The multi-tree approach to reliability in distributed networks
• Connectivity and edge-disjoint spanning trees
• Bounds of the number of disjoint spanning trees
• Interlacing eigenvalues and graphs
• Note on edge-disjoint spanning trees and eigenvalues
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-connectivity and (signless) Laplacian eigenvalue of graphs
• Edge-disjoint spanning trees and eigenvalues
• 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 the spanning tree packing number of a graph: A survey

This page was built for publication: Spanning tree packing number and eigenvalues of graphs with given girth