✦ LIBER ✦

Maximal Energy Graphs

✍ Scribed by Jack H. Koolen; Vincent Moulton

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 65 KB
Volume: 26
Category: Article
ISSN: 0196-8858
DOI: 10.1006/aama.2000.0705

No coin nor oath required. For personal study only.

✦ Synopsis

Given a graph G, its energy E G is defined as the sum of the absolute values of the eigenvalues of G. The concept of the energy of a graph was introduced in the subject of chemistry by I. Gutman, due to its relevance to the total π-electron energy of certain molecules. In this paper, we show that if G is a graph on n vertices, then E G ≤ n

📜 SIMILAR VOLUMES

The Maximal Exceptional Graphs

✍ D. Cvetković; M. Lepović; P. Rowlinson; S.K. Simić 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 170 KB

Random maximal H-free graphs

✍ Deryk Osthus; Anusch Taraz 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB 👁 2 views

Given a graph H, a random maximal H-free graph is constructed by the following random greedy process. First assign to each edge of the complete graph on n vertices a birthtime which is uniformly distributed in [0, 1]. At time p = 0 start with the empty graph and increase p gradually. Each time a new

Centers of maximal outerplanar graphs

✍ Andrzej Proskurowski 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB

## Abstract The center of a graph is defined to be the subgraph induced by the set of vertices that have minimum eccentricities (i.e., minimum distance to the most distant vertices). It is shown that only seven graphs can be centers of maximal outerplanar graphs.

Extremal maximal uniquely hamiltonian gr

Extremal maximal uniquely hamiltonian graphs

✍ Curtiss A. Barefoot; R. C. Entringer 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 352 KB

## Abstract Let __G__ be a graph of order __n__ with exactly one Hamiltonian cycle and suppose that __G__ is maximal with respect to this property. We determine the minimum number of edges __G__ can have.

Graphs with unique maximal clumpings

✍ Andreas Blass 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB

## Abstract A partition of the vertices of a graph is called a clumping if, for vertices in distinct partition classes, adjacency depends only on the partition classes, not on the specific vertices. We give a simple necessary and sufficient condition for a finite graph to have a unique maximal clum

Maximal non- hamilton-laceable graphs

✍ Gustavus J. Simmons 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 378 KB