✦ LIBER ✦

Eigenvalues and extremal degrees of graphs

✍ Scribed by Vladimir Nikiforov

Book ID: 104036759
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 89 KB
Volume: 419
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.06.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Eigenvalues and degree deviation in grap

Eigenvalues and degree deviation in graphs

✍ Vladimir Nikiforov 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 161 KB

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

Extreme degrees in random graphs

✍ Zbigniew Palka 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 448 KB

Extreme degree sequences of simple graph

Extreme degree sequences of simple graphs

✍ Michael Koren 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 501 KB

Extremality of degree-based graph entrop

Extremality of degree-based graph entropies

✍ Cao, Shujuan; Dehmer, Matthias; Shi, Yongtang 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 417 KB

Graph Decompositions Satisfying Extremal

Graph Decompositions Satisfying Extremal Degree Constraints

✍ Paul A. Catlin 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB

## Abstract We show that the vertex set of any graph __G__ with __p__⩾2 vertices can be partitioned into non‐empty sets __V__~1~, __V__~2~, such that the maximum degree of the induced subgraph 〈__V__~i~〉 does not exceed where p^i^ = |__V__^i^|, for __i__=1, 2. Furthermore, the structure of the in