✦ LIBER ✦

Graphs with eigenvalues at least −2

✍ Scribed by Vijaya Kumar; S.B. Rao; N.M. Singhi

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 776 KB
Volume: 46
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(82)90023-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs whose smallest eigenvalue is a

On graphs whose smallest eigenvalue is at least − 1 − √2

✍ Renee Woo; Arnold Neumaier 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 893 KB

Infinite graphs with the least limiting

Infinite graphs with the least limiting eigenvalue greater than -2

✍ Torgašev Aleksandar 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 479 KB

Minimal Graphs with Crossing Number at L

Minimal Graphs with Crossing Number at Least k

✍ R.B. Richter; C. Thomassen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 277 KB

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.

Contractible Cycles in Graphs with Girth

Contractible Cycles in Graphs with Girth at Least 5

✍ Yoshimi Egawa 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Let k 3 be an integer. We show that if G is a k-connected graph with girth at least 5, then G has an induced cycle Q such that G&V(Q) is (k&1)-connected. 1998 Academic Press ## 1. Introduction By a graph, we mean a finite, undirected, simple graph with no loops and no multiple edges. Let G=(V(G

Nonregular Graphs with Three Eigenvalues

✍ Edwin R. van Dam 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 387 KB

We study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue &2, and give new infinite families of examples. 1998 Academic Press ## 1. Introduction In this paper we look at the graphs that are generalizations of strongly regular graphs (cf. [3, 6, 16]) by drop