Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs (Q2689159): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and edge-connectivity of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and eigenvalues of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3642517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge connectivity, packing spanning trees, and eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral conditions for edge connectivity and packing spanning trees in multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacing eigenvalues and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and eigenvalues of graphs with given girth or clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the tree-packing theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on edge-disjoint spanning trees and eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning tree packing number and eigenvalues of graphs with given girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the third largest eigenvalue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the third largest eigenvalue of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank

Latest revision as of 16:35, 31 July 2024

scientific article
Language Label Description Also known as
English
Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs
scientific article

    Statements

    Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2023
    0 references
    eigenvalue
    0 references
    edge connectivity
    0 references
    spanning tree packing number
    0 references
    quotient matrix
    0 references
    multigraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references