𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some properties of 3-domination-critical graphs

✍ Scribed by Evelyne Flandrin; Feng Tian; Bing Wei; Lei Zhang

Book ID
108316346
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
124 KB
Volume
205
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hamiltonian properties of domination-cri
Hamiltonian properties of domination-critical graphs
✍ Ewa Wojcicka πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 445 KB

## Abstract In this paper we show that every connected, 3‐γ‐critical graph on more than 6 vertices has a Hamiltonian path.

Matching properties in domination critic
Matching properties in domination critical graphs
✍ Nawarat Ananchuen; Michael D. Plummer πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 244 KB

A graph G is said to be k--critical if the size of any minimum dominating set of vertices is k, but if any edge is added to G the resulting graph can be dominated with k -1 vertices. A graph G is factor-critical if G -v has a perfect matching for every vertex v ∈ V (G) and is bicritical if G -u -v h

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