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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Leonardo Silva de Lima / rank
Normal rank
 
Property / author
 
Property / author: Leonardo Silva de Lima / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2216070917 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1508.01784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of the Laplacian of a graph<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The local density of triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjectures involving second largest signless Laplacian eigenvalue of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest eigenvalue of the signless Laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to make a graph bipartite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple group of order 44,352,000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear combinations of graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extrema of graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making a \(K_4\)-free graph bipartite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of spectra of graphs and line graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:58, 11 July 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