Fractional spanning tree packing, forest covering and eigenvalues
DOI10.1016/J.DAM.2016.04.027zbMATH Open1344.05088OpenAlexW2470839248MaRDI QIDQ313822FDOQ313822
Authors: Yanmei Hong, Xiaofeng Gu, Hong-Jian Lai, Qinghai Liu 
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
Recommendations
- Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
- Note on edge-disjoint spanning trees and eigenvalues
- Spanning tree packing number and eigenvalues of graphs with given girth
- Edge-disjoint spanning trees and eigenvalues of graphs
- Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- 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
- Decomposition of Finite Graphs Into Forests
- Edge-disjoint spanning trees and eigenvalues of graphs
- Edge-disjoint spanning trees and eigenvalues
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- 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
- Spectral conditions for edge connectivity and packing spanning trees in multigraphs
Cited In (8)
- Graph rigidity properties of Ramanujan graphs
- 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
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees
- Edge-disjoint spanning trees and forests of graphs
- Spanning tree packing number and eigenvalues of graphs with given girth
- Spectral conditions for graph rigidity in the Euclidean plane
This page was built for publication: Fractional spanning tree packing, forest covering and eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313822)
