Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
type: Item
instance of: scholarly article
title: Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
zbMATH Open document ID: 0785.05065
DOI: 10.1016/0012-365X(93)90156-N
author: Odile Favaron
author: Maryvonne Mahéo
author: Jean-François Saclé
published in: Discrete Mathematics
publication date: 1994-04-13T00:00:00Z
review text: 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.
reviewed by: Bojan Mohar
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 428314
zbMATH Keywords: largest eigenvalue
zbMATH Keywords: adjacency matrix
zbMATH Keywords: Graffiti
zbMATH Keywords: conjectures
Wikidata QID: Q123195334
describes a project that uses: GRAFFITI
MaRDI profile type: Publication
cites work: Large cycles in graphs
cites work: Recent results in the theory of graph spectra
cites work: Lower bounds for the clique and the chromatic numbers of a graph
cites work: Q3197865
cites work: On conjectures of Graffiti
cites work: On the residue of a graph
cites work: Q5341580
cites work: Q3866128
cites work: Q5625207
cites work: Q4873761
cites work: Graph partitioning by eigenvectors
cites work: Bounds on graph eigenvalues
cites work: Q5674306
cites work: The Eigenvalues of a Graph and Its Chromatic Number
description: scientific article; zbMATH DE number 428314