✦ LIBER ✦

Proof of conjectures on adjacency eigenvalues of graphs

✍ Scribed by Kinkar Ch. Das

Book ID: 119227563
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 279 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.09.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Eigenvalues of the adjacency matrix of t

Eigenvalues of the adjacency matrix of tetrahedral graphs

✍ R. C. Bose; Renu Laskar 📂 Article 📅 1970 🏛 Springer 🌐 English ⚖ 274 KB

Proof of conjectures involving the large

Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs

✍ Kinkar Ch. Das 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 493 KB

The proof on the conjecture of extremal

The proof on the conjecture of extremal graphs for the kth eigenvalues of trees

✍ Jiansheng Chen 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 311 KB

Proof of conjectures on remoteness and p

Proof of conjectures on remoteness and proximity in graphs

✍ Hua, Hongbo; Das, Kinkar Ch. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Proof of conjectures involving algebraic

Proof of conjectures involving algebraic connectivity of graphs

✍ Das, Kinkar Ch. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Proof of a conjecture on irredundance pe

Proof of a conjecture on irredundance perfect graphs

✍ Lutz Volkmann; Vadim E. Zverovich 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

## Abstract Let __ir__(__G__) and γ(__G__) be the irredundance number and the domination number of a graph __G__, respectively. A graph __G__ is called __irredundance perfect__ if __ir__(__H__)=γ(__H__), for every induced subgraph __H__ of __G__. In this article we present a result which immediatel