✦ LIBER ✦

Connectedness of certain random graphs

✍ Scribed by L. A. Shepp

Book ID: 112886960
Publisher: The Hebrew University Magnes Press
Year: 1989
Tongue: English
Weight: 469 KB
Volume: 67
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02764896

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Determining the hamilton-connectedness o

Determining the hamilton-connectedness of certain vertex-transitive graphs

✍ Ming Jiang; Frank Ruskey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Faber and Moore have proposed a class of vertex-transitive digraphs as a model of directed inconnection networks. These networks have attractive degree versus diameter properties. We show that these digraphs are Hamiltonian and provide necessary and sufficient conditions for the existence of a Hamil

On the strength of connectedness of a ra

On the strength of connectedness of a random graph

✍ P. Erdős; A. Rényi 📂 Article 📅 1964 🏛 Akadmiai Kiad 🌐 English ⚖ 233 KB

Connectedness of finite distance graphs

✍ Domingo Gómez-Pérez; Jaime Gutierrez; Álvar Ibeas 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

Limit distributions of certain character

Limit distributions of certain characteristics of random automaton graphs

✍ A. A. Grusho 📂 Article 📅 1973 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 367 KB

Connectednesses and disconnectednesses o

Connectednesses and disconnectednesses of graphs

✍ E. Fried; R. Wiegandt 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 945 KB

Collapsible graphs and Hamiltonian conne

Collapsible graphs and Hamiltonian connectedness of line graphs

✍ Weihua Yang; Hongjian Lai; Hao Li; Xiaofeng Guo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 223 KB