Some eigenvalue properties in graphs (conjectures of Graffiti -- II) (Q686466): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Maryvonne Maheo / rank
 
Normal rank
Property / author
 
Property / author: Jean-François Saclé / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GRAFFITI / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results in the theory of graph spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the clique and the chromatic numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjectures of Graffiti / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the residue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3866128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning by eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on graph eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / 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 10:09, 22 May 2024

scientific article
Language Label Description Also known as
English
Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
scientific article

    Statements

    Some eigenvalue properties in graphs (conjectures of Graffiti -- II) (English)
    0 references
    0 references
    0 references
    0 references
    13 April 1994
    0 references
    Several bounds on the largest eigenvalue of the adjacency matrix of a graph are presented. Some additional inequalities relate eigenvalues and some other graph invariants. As a consequence, numerous conjectures of the computer program Graffiti are settled. On the other hand, 49 (forty nine) conjectures of the same program are disproved by means of counterexamples (usually infinite families). Concerning the settled and eliminated conjectures, it is not clear to the reviewer what is their mathematical value. Nevertheless, it is to be stressed that a paper containing many proved and disproved conjectures is very difficult to find.
    0 references
    0 references
    largest eigenvalue
    0 references
    adjacency matrix
    0 references
    Graffiti
    0 references
    conjectures
    0 references

    Identifiers