✦ LIBER ✦

Spectral upper bounds for the order of a k-regular induced subgraph

✍ Scribed by Domingos M. Cardoso; Peter Rowlinson

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 136 KB
Volume: 433
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.04.029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exponential upper and lower bounds for t

Exponential upper and lower bounds for the order of a regular language

✍ Andreas Weber 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 547 KB

On upper bounds for the spectral variati

On upper bounds for the spectral variation of two regular matrix pairs

✍ Guoxing Wu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 102 KB

Upper bounds for the spectral variation of two regular matrix pairs have been given in [Guoxing Wu, Optimal bounds for the spectral variation of two regular matrix pairs, Linear Algebra Appl. 418 (2006) 891-899; G.W. Stewart, An Elsner-like perturbation theorem for generalized eigenvalues, Linear Al

A new upper bound for the Laplacian spec

A new upper bound for the Laplacian spectral radius of graphs

✍ Ji-Ming Guo 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 172 KB

An upper bound for the number of Euleria

An upper bound for the number of Eulerian orientations of a regular graph

✍ M. Las Vergnas 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 168 KB

An upper bound for the spectral conditio

An upper bound for the spectral condition number of a diagonalizable matrix

✍ Erxiong Jiang; Peter C.B. Lam 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 382 KB

An upper bound for the k-domination numb

An upper bound for the k-domination number of a graph

✍ E. J. Cockayne; B. Gamble; B. Shepherd 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

The kdomination number of a graph G, y k ( G ) , is the least cardinality of a set U of verticies such that any other vertex is adjacent to at least k vertices of U. We prove that if each vertex has degree at least k. then YAG) 5 kp/(k + 1).