𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New results on 3-domination critical graphs

✍ Scribed by Camino Balbuena, Adriana Hansberg

Book ID
113013748
Publisher
Springer
Year
2011
Tongue
English
Weight
274 KB
Volume
83
Category
Article
ISSN
0001-9054

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

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