Minimum cuts, girth and a spectral threshold (Q1029057): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues, diameter, and mean distance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Moore bound for irregular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new series of dense graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A High Girth Graph Construction / rank
 
Normal rank

Latest revision as of 18:03, 1 July 2024

scientific article
Language Label Description Also known as
English
Minimum cuts, girth and a spectral threshold
scientific article

    Statements

    Minimum cuts, girth and a spectral threshold (English)
    0 references
    0 references
    9 July 2009
    0 references
    Laplacian spectrum
    0 references
    minimum cuts
    0 references
    girth
    0 references
    graph algorithms
    0 references

    Identifiers