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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6566509 / rank
 
Normal rank
Property / zbMATH Keywords
 
blow-up graphs
Property / zbMATH Keywords: blow-up graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
Laplacian
Property / zbMATH Keywords: Laplacian / rank
 
Normal rank
Property / zbMATH Keywords
 
signless Laplacian
Property / zbMATH Keywords: signless Laplacian / rank
 
Normal rank
Property / zbMATH Keywords
 
complete subgraphs
Property / zbMATH Keywords: complete subgraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
extremal problem
Property / zbMATH Keywords: extremal problem / rank
 
Normal rank
Property / zbMATH Keywords
 
clique number
Property / zbMATH Keywords: clique number / rank
 
Normal rank

Revision as of 14:44, 27 June 2023

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