𝔖 Bobbio Scriptorium
✦   LIBER   ✦

(F_{3})-domination problem of graphs

✍ Scribed by Chan-Wei Chang, David Kuo, Sheng-Chyang Liaw…

Book ID
120694222
Publisher
Springer US
Year
2012
Tongue
English
Weight
339 KB
Volume
28
Category
Article
ISSN
1382-6905

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