✦ LIBER ✦

Hamilton-connectivity of 3-domination critical graphs with

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

Book ID: 108113806
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 236 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.03.075

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Hamilton-connectivity of 3-Domination Cr

Hamilton-connectivity of 3-Domination Critical Graphs with α = δ  +  2

✍ Yaojun Chen; Feng Tian; Yunqing Zhang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A graph G is 3-domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. It was proved by Favaron et al. that α ≤ δ + 2 for any connected 3-domination critical graph. Denote by τ (G) the toughness of a graph G. Recently Chen et al. conjectured that a connecte

Connected domination critical graphs

✍ Xue-Gang Chen; Liang Sun; De-Xiang Ma 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 339 KB

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

Independence and hamiltonicity in 3-domi

Independence and hamiltonicity in 3-domination-critical graphs

✍ Favaron, Odile; Tian, Feng; Zhang, Lei 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 3 views

Let δ, γ, i and α be respectively the minimum degree, the domination number, the independent domination number and the independence number of a graph G. The graph G is 3-γ-critical if γ = 3 and the addition of any edge decreases γ by 1. It was conjectured that any connected 3-γ-critical graph satisf

Some properties of 3-domination-critical

Some properties of 3-domination-critical graphs

✍ Evelyne Flandrin; Feng Tian; Bing Wei; Lei Zhang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 124 KB