On Maximum Matchings and Eigenvalues of Benzenoid Graphs

Fajtlowicz, Siemion; John, Peter E. GND; Sachs, Horst GND

In August 2003 the computer program GRAFFITI made conjecture 1001 stating that for any benzenoid graph, the size of a maximum matching equals the number of positive eigenvalues. Later, the authors learned that this conjecture was already known in 1982 to I. Gutman (Kragujevac). Here we present a proof of this conjecture and of a related theorem. The results are of some relevance in the theory of (unsaturated) polycyclic hydrocarbons.

Cite

Citation style:

Fajtlowicz, Siemion / John, Peter E. / Sachs, Horst: On Maximum Matchings and Eigenvalues of Benzenoid Graphs. 2005.

Access Statistic

Total:
Downloads:
Abtractviews:
Last 12 Month:
Downloads:
Abtractviews:

open graphic

Rights

Use and reproduction:
All rights reserved

Export