Spectral conditions for edge connectivity and packing spanning trees in multigraphs
From MaRDI portal
Publication:905705
DOI10.1016/J.LAA.2015.11.038zbMATH Open1329.05189OpenAlexW2200264387MaRDI QIDQ905705FDOQ905705
Publication date: 28 January 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2015.11.038
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- 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
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- 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
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Eigenvalues and edge-connectivity of regular graphs
- Edge-connectivity in regular multigraphs from eigenvalues
Cited In (9)
- Graph rigidity properties of Ramanujan graphs
- Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
- Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
- Fractional spanning tree packing, forest covering and eigenvalues
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees
- 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
- Edge connectivity, packing spanning trees, and eigenvalues of graphs
This page was built for publication: Spectral conditions for edge connectivity and packing spanning trees in multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905705)
