Toughness and normalized Laplacian eigenvalues of graphs (Q2139788): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tough Ramsey graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness in graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and spectrum of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3127430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3160533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectrum and toughness of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3642517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue bounds for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness in pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of Brouwer's Toughness Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph toughness from Laplacian eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound on the matching number of graphs via Laplacian eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new eigenvalue bound for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with equal algebraic and vertex connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian spectral bounds for clique and independence numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree / rank
 
Normal rank

Latest revision as of 00:44, 29 July 2024

scientific article
Language Label Description Also known as
English
Toughness and normalized Laplacian eigenvalues of graphs
scientific article

    Statements

    Toughness and normalized Laplacian eigenvalues of graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2022
    0 references
    toughness
    0 references
    normalized Laplacian eigenvalue
    0 references
    algebraic connectivity
    0 references

    Identifiers