Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs

DOI10.1016/J.LAA.2023.01.022MaRDI QIDQ2689159zbMATH OpenOpenAlexFDO

Authors Yang Hu, Ligong Wang, Cunxiang Duan

Publication date 9 March 2023

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

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

zbMATH Keywords

edge connectivityeigenvaluemultigraphquotient matrixspanning tree packing number

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Spectral conditions for edge connectivity and packing spanning trees in multigraphs
• Edge connectivity, packing spanning trees, and eigenvalues of graphs
• On spanning tree packings of highly edge connected graphs
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• On the number of spanning trees in graphs with multiple edges
• Spanning tree packing number and eigenvalues of graphs with given girth
• Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
• On the spanning tree packing number of a graph: A survey
• Spanning tree packing and 2-essential edge-connectivity
• Extremal graphs for a spectral inequality on edge-disjoint spanning trees

Cites work

• A short proof of the tree-packing theorem
• An introduction to the theory of graph spectra
• Connectivity and eigenvalues of graphs with given girth or clique number
• Edge connectivity, packing spanning trees, and eigenvalues of graphs
• 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 of Finite Graphs
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• Eigenvalues and edge-connectivity of regular graphs
• 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 third largest eigenvalue of a graph
• On the third largest eigenvalue of graphs
• Spanning tree packing number and eigenvalues of graphs with given girth
• Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
• Spectra of graphs
• Spectral conditions for edge connectivity and packing spanning trees in multigraphs

Cited in

(9)

• Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
• Edge connectivity, packing spanning trees, and eigenvalues of graphs
• Spectral radius and edge‐disjoint spanning trees
• The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
• 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
• Laplacian eigenvalue conditions for edge-disjoint spanning trees and a forest with constraints
• Title not available (Why is no real title available?)
• Spectral conditions for edge connectivity and packing spanning trees in multigraphs

This page was built for publication: Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs

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