✦ LIBER ✦

Bounds for the Least Laplacian Eigenvalue of a Signed Graph

✍ Scribed by Yao Ping Hou

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2004
Tongue: English
Weight: 136 KB
Volume: 21
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-004-0437-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper Bounds for the Laplacian Graph Eig

Upper Bounds for the Laplacian Graph Eigenvalues

✍ Jiong Sheng Li; Yong Liang Pan 📂 Article 📅 2004 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 129 KB

A sharp lower bound for the least eigenv

A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph

✍ Domingos M. Cardoso; Dragoš Cvetković; Peter Rowlinson; Slobodan K. Simić 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 149 KB

We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected nonbipartite graph with a prescribed number of vertices is attained solely in the unicyclic graph obtained from a triangle by attaching a path at one of its endvertices.

Sharp bounds for the largest eigenvalue

Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph

✍ Yanqing Chen; Ligong Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 194 KB

A new upper bound for eigenvalues of the

A new upper bound for eigenvalues of the laplacian matrix of a graph

✍ Li Jiong-Sheng; Zhang Xiao-Dong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 270 KB

We first give a result on eigenvalues of the line graph of a graph. We then use the result to present a new upper bound for eigenvalues of the Laplacian matrix of a graph. Moreover we determine all graphs the largest eigenvalue of whose Laplacian matrix reaches the upper bound.

Bounding the gap between extremal Laplac

Bounding the gap between extremal Laplacian eigenvalues of graphs

✍ Felix Goldberg 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 101 KB

Let G be a graph whose Laplacian eigenvalues are 0 = λ 1 λ 2 • • • λ n . We investigate the gap (expressed either as a difference or as a ratio) between the extremal non-trivial Laplacian eigenvalues of a connected graph (that is λ n and λ 2 ). This gap is closely related to the average density of c

A decreasing sequence of upper bounds on

A decreasing sequence of upper bounds on the largest Laplacian eigenvalue of a graph

✍ Oscar Rojo; Héctor Rojo 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 251 KB