✦ LIBER ✦

Connected domination critical graphs

✍ Scribed by Xue-Gang Chen; Liang Sun; De-Xiang Ma

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 339 KB
Volume: 17
Category: Article
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(04)90118-8

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

Domination critical graphs

✍ David P Sumner; Pattie Blitch 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 531 KB

Domination critical graphs

✍ David P Sumner; Pattie Blitch 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 531 KB

The smallest cardinality of any such dominating set is called the domination number of G and is denoted by y(G). The purpose of this paper is to initiate an investigation of those graphs which are critical in the following sense: For each v, u E V(G) with v not adjacent to u, y(G + vu) < y(G). Thus

Vertex domination-critical graphs

✍ Jason Fulman; Denis Hanson; Gary Macgillivray 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 293 KB

Vertex domination-critical graphs

✍ Robert C. Brigham; Phyllis Z. Chinn; Ronald D. Dutton 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 303 KB

Distance domination-critical graphs

✍ Fang Tian; Jun-Ming Xu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 176 KB

for any vertex x in G. This work considers properties of k-distance domination-critical graphs and establishes a best possible upper bound on the diameter of a 2-distance domination-critical graph G, that is, d(G) ≤ 3(γ 2 -1) for γ 2 ≥ 2.