✦ LIBER ✦

Graphs characterized by the second eigenvalue

✍ Scribed by Dasong Cao; Hong Yuan

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 266 KB
Volume: 17
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190170307

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this paper we prove that for a simple graph G without isolated vertices 0 < λ~2~(G) < 1/3 if and only if G ≅ K̄~n‐3~ V (K~1~ ∪ K~2~), the graph obtained by joining each vertex of K̄~n‐3~ to each vertex of K~1~ ∪ K~2~). © 1993 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

On the second largest eigenvalue of line

On the second largest eigenvalue of line graphs

✍ Petrovi?, Miroslav; Mileki?, Bojana 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 2 views

In this paper all connected line graphs whose second largest eigenvalue does not exceed 1 are characterized. Besides, all minimal line graphs with second largest eigenvalue greater than 1 are determined.

Characterizations of second iterated lin

Characterizations of second iterated line graphs

✍ Zhao Guangfu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB

On the embedding of graphs into graphs w

On the embedding of graphs into graphs with few eigenvalues

✍ Vu, Van H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

A graph is called of type k if it is connected, regular, and has k distinct eigenvalues. For example graphs of type 2 are the complete graphs, while those of type 3 are the strongly regular graphs. We prove that for any positive integer n, every graph can be embedded in n cospectral, non-isomorphic

The Second Periodic Eigenvalue and the A

The Second Periodic Eigenvalue and the Alikakos–Fusco Conjecture

✍ Vassilis G. Papanicolaou 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 343 KB

We investigate the maximality properties of the second periodic eigenvalue of the Hill's operator. The potential function is normalized so that its average over a period is zero. Apart from its own significance, this question is related to the study of the motion-by-curvature equation. 1996 Academi

Characterizing directed path graphs by f

Characterizing directed path graphs by forbidden asteroids

✍ Kathie Cameron; Chính T. Hoàng; Benjamin Lévêque 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central role in a classical characterization of interval graphs by Lekkerkerker and Boland. Their result says that a chordal grap

Characterizing path graphs by forbidden

Characterizing path graphs by forbidden induced subgraphs

✍ Benjamin Lévêque; Frédéric Maffray; Myriam Preissmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. © 2009