✦ LIBER ✦

Hamiltonian graphs with minimum number of edges for fault-tolerant topologies

✍ Scribed by Krishnendu Mukhopadhyaya; Bhabani P. Sinha

Book ID: 107766063
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 392 KB
Volume: 44
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90192-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A family of Hamiltonian and Hamiltonian

A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance

✍ Y-Chuang Chen; Yong-Zen Huang; Lih-Hsing Hsu; Jimmy J. M. Tan 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 417 KB

Graphs of diameter 3 with the minimum nu

Graphs of diameter 3 with the minimum number of edges

✍ Zoltán Füredi 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 231 KB

Primitive graphs with given exponents an

Primitive graphs with given exponents and minimum number of edges

✍ Byeong Moon Kim; Byung Chul Song; Woonjae Hwang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 364 KB

The minimum number of edges in graphs wi

The minimum number of edges in graphs with prescribed paths

✍ Nicholas Pippenger 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 919 KB

Edge-deletable IM-extendable graphs with

Edge-deletable IM-extendable graphs with minimum number of edges

✍ Xiumei Wang; Jinjiang Yuan; Sujing Zhou 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 500 KB

On the domination number of Hamiltonian

On the domination number of Hamiltonian graphs with minimum degree six

✍ Hua-Ming Xing; Johannes H. Hattingh; Andrew R. Plummer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 177 KB

The domination number of G, denoted by γ (G), is the minimum cardinality of a dominating set of G. We prove that if G is a Hamiltonian graph of order n with minimum degree at least six, then γ (G) ≤ 6n 17 .