Fractional spanning tree packing, forest covering and eigenvalues
From MaRDI portal
Publication:313822
DOI10.1016/j.dam.2016.04.027zbMath1344.05088OpenAlexW2470839248MaRDI QIDQ313822
Yanmei Hong, Hong-Jian Lai, Qinghai Liu, Xiaofeng Gu
Publication date: 12 September 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.04.027
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (7)
Fractional matching number and spectral radius of nonnegative matrices of graphs ⋮ Extremal graphs for a spectral inequality on edge-disjoint spanning trees ⋮ Spectral radius and edge‐disjoint spanning trees ⋮ Graph rigidity properties of Ramanujan graphs ⋮ Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number ⋮ Edge-disjoint spanning trees and forests of graphs ⋮ Spectral conditions for graph rigidity in the Euclidean plane
Cites Work
- Unnamed Item
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Spectra of graphs
- Spectral conditions for edge connectivity and packing spanning trees in multigraphs
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Interlacing eigenvalues and graphs
- Note on edge-disjoint spanning trees and eigenvalues
- Edge-disjoint spanning trees and eigenvalues 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
- Decomposition of Finite Graphs Into Forests
This page was built for publication: Fractional spanning tree packing, forest covering and eigenvalues
