𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some results related to the toughness of 3-domination critical graphs

✍ Scribed by Nawarat Ananchuen; Michael D. Plummer

Book ID
108315896
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
178 KB
Volume
272
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Some results on characterizing the edges
Some results on characterizing the edges of connected graphs with a given domination number
✍ Laura A. Sanchis πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v β€’ V-V' there exists some uβ€’ V' for which {v,u} β€’E. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu

Erratum to: β€œA linear vizing-like relati
Erratum to: β€œA linear vizing-like relation relating the size and total domination number of a graph”
✍ Erfang Shan; Liying Kang; Michael A. Henning πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 83 KB

## Abstract The proof of the main theorem in the paper [1] is incorrect as it is missing an important case. Here we complete the proof by giving the missing case. Β© 2007 Wiley Periodicals, Inc. J Graph Theory 54: 350–353, 2007