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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Maryvonne Maheo / rank
 
Normal rank
Property / author
 
Property / author: Jean-François Saclé / rank
 
Normal rank

Revision as of 14:40, 11 February 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