✦ LIBER ✦

A note on the domination dot-critical graphs

✍ Scribed by Xue-gang Chen; Wai Chee Shiu

Book ID: 108112835
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 291 KB
Volume: 157
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.07.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Domination dot-critical graphs

✍ Tamara Burton; David P. Sumner 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Note: The diameter of edge domination cr

Note: The diameter of edge domination critical graphs

✍ Matteo Paris 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

A note on the characterization of domina

A note on the characterization of domination perfect graphs

✍ Jason Fulman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract A graph __G__ is domination perfect if for each induced subgraph __H__ of __G__, γ(__H__) = __i__(__H__), where γ and __i__ are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of

Local edge domination critical graphs

✍ Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 521 KB

Sumner and Blitch defined a graph G to be k-y-critical if 7(G) = k and 7(G + uv) = k -1 for each pair u, v of nonadjacent vertices of G. We define a graph to be k-( 7,d)-critical if 7(G) = k and 7(G + uv) = k -I for each pair u, v of nonadjacent vertices of G that are at distance at most d apart. Th

Note on 2-rainbow domination and Roman d

Note on 2-rainbow domination and Roman domination in graphs

✍ Yunjian Wu; Huaming Xing 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 244 KB

A Roman dominating function of a graph G is a function f : V → {0, 1, 2} such that every vertex with 0 has a neighbor with 2. The minimum of f (V (G)) = v∈V f (v) over all such functions is called the Roman domination number γ R (G). A 2-rainbow dominating function of a graph G is a function g that

A note on kernel-critical graphs

✍ Pierre Duchet; Henri Meyniel 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 410 KB