✦ LIBER ✦

Sharp bounds for the spectral radius of digraphs

✍ Scribed by Guang-Hui Xu; Chang-Qing Xu

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 109 KB
Volume: 430
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.05.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for the spectral radius of

A lower bound for the spectral radius of a digraph

✍ E. Gudiño; J. Rada 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Sharp upper bounds on the spectral radiu

Sharp upper bounds on the spectral radius of graphs

✍ Jinlong Shu; Yarong Wu 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 176 KB

A Sharp Upper Bound of the Spectral Radi

A Sharp Upper Bound of the Spectral Radius of Graphs

✍ Yuan Hong; Jin-Long Shu; Kunfu Fang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 88 KB

Sharp bounds on the distance spectral ra

Sharp bounds on the distance spectral radius and the distance energy of graphs

✍ G. Indulal 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Lower bounds for the spectral radius of

Lower bounds for the spectral radius of a matrix

✍ Bill G. Horne 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 444 KB

We develop lower bounds for the spectral radius of symmetric, skew-symmetric, and arbitrary real matrices, Our approach utilizes the well-known Leverrier-Faddeev algorithm for calculating the coefficients of the characteristic polynomial of a matrix in conjunction with a theorem by Lucas which state

Spectral radius of digraphs with given d

Spectral radius of digraphs with given dichromatic number

✍ Huiqiu Lin; Jinlong Shu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 237 KB

Let D be a digraph with vertex set V (D). A partition of V (D) into k acyclic sets is called a k-coloring of D. The minimum integer k for which there exists a k-coloring of D is the dichromatic number χ(D) of the digraph D. Denote G n,k the set of the digraphs of order n with the dichromatic number