Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph (Q5069684): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/09720529.2013.878822 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020100449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on deleting a vertex and weak interlacing of the Laplacian spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the signless Laplacian eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Eigenvalues of a Graph and Its Chromatic Number / rank
 
Normal rank

Latest revision as of 16:09, 28 July 2024

scientific article; zbMATH DE number 7509032
Language Label Description Also known as
English
Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph
scientific article; zbMATH DE number 7509032

    Statements

    Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph (English)
    0 references
    19 April 2022
    0 references
    Laplacian eigenvalue
    0 references
    signless Laplacian eigenvalue
    0 references
    independence number
    0 references
    chromatic number
    0 references
    total chromatic number
    0 references

    Identifiers