✦ LIBER ✦

Spectral radius of strongly connected digraphs

✍ Scribed by Huiqiu Lin; Jinlong Shu; Yarong Wu; Guanglong Yu

Book ID: 118738397
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 251 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.07.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance spectral radius of digraphs wit

Distance spectral radius of digraphs with given connectivity

✍ Huiqiu Lin; Weihua Yang; Hailiang Zhang; Jinlong Shu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 293 KB

A note on the spectral characterization

A note on the spectral characterization of strongly connected bicyclic digraphs

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

Strongly Hamiltonian-connected locally s

Strongly Hamiltonian-connected locally semicomplete digraphs

✍ Guo, Yubao 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 513 KB

We give some sufficient conditions for locally semicomplete digraphs to contain a hamiltonian path from a prescribed vertex to another prescribed vertex. As an immediate consequence of these, we obtain that every 4-connected locally semicomplete digraph is strongly hamiltonian-connected. Our results

The distance spectral radius of digraphs

✍ Lin, Huiqiu; Shu, Jinlong 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 408 KB

The strongly connected reliability of co

The strongly connected reliability of complete digraphs

✍ J.I. Brown; Xiaohu Li 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB

Uniformly optimal digraphs for strongly

Uniformly optimal digraphs for strongly connected reliability

✍ J.I. Brown; Xiaohu Li 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB