Spanning tree packing number and eigenvalues of graphs with given girth (Q2321370): 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: Edge-connectivity and edge-disjoint spanning trees / 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: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal attack and reinforcement of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3444931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and edge-disjoint spanning trees / 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: The multi-tree approach to reliability in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of the number of disjoint spanning trees / 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: Edge-connectivity and (signless) Laplacian eigenvalue of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and eigenvalues / 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 of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning tree packing number of a graph: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5785712 / 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

Revision as of 08:19, 20 July 2024

scientific article
Language Label Description Also known as
English
Spanning tree packing number and eigenvalues of graphs with given girth
scientific article

    Statements

    Spanning tree packing number and eigenvalues of graphs with given girth (English)
    0 references
    0 references
    0 references
    0 references
    29 August 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    girth
    0 references
    edge-disjoint spanning trees
    0 references
    spanning tree packing number
    0 references
    edge-connectivity
    0 references
    eigenvalue
    0 references
    quotient matrix
    0 references
    0 references