✦ LIBER ✦

The least eigenvalue of unicyclic graphs with vertices and pendant vertices

✍ Scribed by Ruifang Liu; Mingqing Zhai; Jinlong Shu

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 275 KB
Volume: 431
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.03.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The spectral radius of unicyclic and bic

The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices

✍ Shu-Guang Guo 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The Laplacian spectral radius of tricycl

The Laplacian spectral radius of tricyclic graphs with vertices and pendant vertices

✍ Shu-Guang Guo; Yan-Feng Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 220 KB

The least eigenvalue of a graph with cut

The least eigenvalue of a graph with cut vertices

✍ Yi Wang; Yi-Zheng Fan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 175 KB

Unicyclic graphs with given number of pe

Unicyclic graphs with given number of pendent vertices and minimal energy

✍ Hongbo Hua; Maolin Wang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 196 KB

The energy of a graph G, denoted by E(G), is defined to be the sum of absolute values of all eigenvalues of the adjacency matrix of G. Let G(n, l, p) denote the set of all unicyclic graphs on n vertices with girth and pendent vertices being l ( 3) and p ( 1), respectively. More recently, one of the

Labelled graphs with vertices of degree

Labelled graphs with vertices of degree at least three

✍ I. P. Goulden; D. M. Jackson 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 463 KB 👁 1 views

The generating function for labelled graphs in which each vertex has degree at least three is obtained by the Principle of Inclusion and Exclusion. Asymptotic and explicit values for the coefficients are calculated in the connected case. The results are extended to bipartite graphs.

Graphs with given odd sets and the least

Graphs with given odd sets and the least number of vertices

✍ Louis Hakimi, S. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 2 views

This note presents a solution to the following problem posed by Chen, Schelp, and Soltés: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given.