✦ LIBER ✦

Some graphs with small second eigenvalue

✍ Scribed by Joel Friedman

Publisher: Springer-Verlag
Year: 1995
Tongue: English
Weight: 577 KB
Volume: 15
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01294458

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bipartite graphs with small third Laplac

Bipartite graphs with small third Laplacian eigenvalue

✍ Xiao-Dong Zhang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 420 KB

In this paper, all connected bipartite graphs are characterized whose third largest Laplacian eigenvalue is less than three. Moreover, the result is used to characterize all connected bipartite graphs with exactly two Laplacian eigenvalues not less than three, and all connected line graphs of bipart

Graphs characterized by the second eigen

Graphs characterized by the second eigenvalue

✍ Dasong Cao; Hong Yuan 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

## 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

Graphs with a Small Number of Nonnegativ

Graphs with a Small Number of Nonnegative Eigenvalues

✍ Miroslav Petrović 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 130 KB

On the second eigenvalue of a graph

✍ A. Nilli 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Nilli, A., On the second eigenvalue of a graph, Discrete Mathematics 91 (1991) 207-210. It is shown that the second largest eigenvalue of the adjacency matrix of any G containing two edges the distance between which is at least 2k + 2 is at least (2G -l)/(k + 1).

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.

Some Minimal Graphs by Interlacing Eigen

Some Minimal Graphs by Interlacing Eigenvalues

✍ H.B. Walikar; P.R. Hamipholi; H.S. Ramane 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Let \(G\) be a simple graph with \(p\) vertices and let \(A(G)\) be the adjacency matrix of \(G\). The characteristic polynomial of \(G\) is the characteristic polynomial of \(A(G)\) and roots of the characteristic equation are the eigenvalues of \(G\). In this paper we compute the characteristic po