✦ LIBER ✦

Codiameters of 3-domination critical graphs with toughness more than one

✍ Scribed by T.C. Edwin Cheng; Yaojun Chen; C.T. Ng

Book ID: 108113964
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 965 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.11.061

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Codiameters of 3-connected 3-domination

Codiameters of 3-connected 3-domination critical graphs

✍ Yaojun Chen; Feng Tian; Bing Wei 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

## Abstract A graph __G__ is 3‐domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. Let __G__ be a 3‐connected 3‐domination critical graph of order __n__. In this paper, we show that there is a path of length at least __n__−2 between any two distinct ve

Some results related to the toughness of

✍ Nawarat Ananchuen; Michael D. Plummer 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Hamilton-connectivity of 3-domination cr

Hamilton-connectivity of 3-domination critical graphs with

✍ Yaojun Chen; T.C. Edwin Cheng; C.T. Ng 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Hamilton-connectivity of 3-domination-cr

Hamilton-connectivity of 3-domination-critical graphs with α⩽δ

✍ Yaojun Chen; Feng Tian; Bing Wei 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 296 KB

Wiener index of graphs with more than on

Wiener index of graphs with more than one cut-vertex

✍ R. Balakrishnan; N. Sridharan; K. Viswanathan Iyer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 338 KB

Erratum to: “Some results related to the

Erratum to: “Some results related to the toughness of 3-domination critical graphs” [Discrete Math. 272 (2003) 5–15]

✍ Nawarat Ananchuen; Michael D. Plummer 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 106 KB