The clique number and the smallest \(Q\)-eigenvalue of graphs (Q267202): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2216070917 / rank
 
Normal rank

Revision as of 22:16, 19 March 2024

scientific article
Language Label Description Also known as
English
The clique number and the smallest \(Q\)-eigenvalue of graphs
scientific article

    Statements

    The clique number and the smallest \(Q\)-eigenvalue of graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 April 2016
    0 references
    blow-up graphs
    0 references
    Laplacian
    0 references
    signless Laplacian
    0 references
    complete subgraphs
    0 references
    extremal problem
    0 references
    clique number
    0 references

    Identifiers