Spectral radius and edge‐disjoint spanning trees (Q6084711): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Spectral conditions for graph rigidity in the Euclidean plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for a spectral inequality on edge-disjoint spanning trees / 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: Optimal attack and reinforcement of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius conditions for the rigidity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (k,d)-colorings and fractional nowhere-zero flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / 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: Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional spanning tree packing, forest covering and eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp upper bound of the spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing spanning trees in highly essentially connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circular flows of graphs / 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: Spanning tree packing number and eigenvalues of graphs with given girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of graphs with cut edges / 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: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Inequalities for the Largest Eigenvalue of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigidity of Frameworks Supported on Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Generically Rigid Frameworks on Surfaces of Revolution / 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: Rigidity of multi-graphs. I: Linking rigid bodies in n-space / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:30, 3 August 2024

scientific article; zbMATH DE number 7761622
Language Label Description Also known as
English
Spectral radius and edge‐disjoint spanning trees
scientific article; zbMATH DE number 7761622

    Statements

    Spectral radius and edge‐disjoint spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    6 November 2023
    0 references
    edge connectivity
    0 references
    eigenvalue
    0 references
    spanning tree packing
    0 references
    spectral radius
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references