Note on edge-disjoint spanning trees and eigenvalues

From MaRDI portal
Publication:2250921

DOI10.1016/j.laa.2014.05.044zbMath1295.05146OpenAlexW2079208696MaRDI QIDQ2250921

Hong-Jian Lai, Qinghai Liu, Xiaofeng Gu, Yanmei Hong

Publication date: 22 July 2014

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

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




Related Items (24)

Fractional matching number and spectral radius of nonnegative matrices of graphsThe general spectral radii of (multicone-)graphs with prescribed degree sequenceLattices over Bass rings and graph agglomerationsFractional spanning tree packing, forest covering and eigenvaluesExtremal graphs for a spectral inequality on edge-disjoint spanning treesStrengthened Ore conditions for \((s, t)\)-supereulerian graphsSpanning trees of bounded degree, connectivity, toughness, and the spectrum of a graphSpectral radius and edge‐disjoint spanning treesGraph rigidity properties of Ramanujan graphsSpectral conditions for edge connectivity and spanning tree packing number in (multi-)graphsSpectral conditions for edge connectivity and packing spanning trees in multigraphsEdge connectivity, packing spanning trees, and eigenvalues of graphsOn \(( s , t )\)-supereulerian graphs with linear degree boundsToughness in pseudo-random graphsConnectivity and eigenvalues of graphs with given girth or clique numberFractional arboricity, strength and eigenvalues of graphs with fixed girth or clique numberVertex-connectivity and eigenvalues of graphs with fixed girthVertex-connectivity and eigenvalues of graphsSpectral conditions for graph rigidity in the Euclidean planeConnectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphsSpanning tree packing number and eigenvalues of graphs with given girthHamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphsComplete family reduction and spanning connectivity in line graphsSpectral and extremal conditions for supereulerian graphs




Cites Work




This page was built for publication: Note on edge-disjoint spanning trees and eigenvalues