✦ LIBER ✦

Non–bipartite Graphs with Third Largest Laplacian Eigenvalue Less Than Three

✍ Scribed by Xiao Dong Zhang; Rong Luo

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2006
Tongue: English
Weight: 225 KB
Volume: 22
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-005-0747-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with three distinct eigenvalues a

Graphs with three distinct eigenvalues and largest eigenvalue less than

✍ H. Chuang; G.R. Omidi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 159 KB

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

On graphs with at most three Laplacian e

On graphs with at most three Laplacian eigenvalues greater than or equal to two

✍ Miroslav Petrović; Bojana Borovićanin; Aleksandar Torgašev 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 236 KB