𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper Bound on the Diameter of a Domination Dot-Critical Graph

✍ Scribed by Michitaka Furuya, Masanori Takatou

Book ID
118783115
Publisher
Springer Japan
Year
2011
Tongue
English
Weight
182 KB
Volume
29
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The diameter of domination k-critical gr
The diameter of domination k-critical graphs
✍ Odile Favaron; David P. Sumner; Ewa Wojcicka πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 525 KB

## Abstract A graph is __k__‐domination‐critical if Ξ³(__G) = k__, and for any edge __e__ not in __G__, Ξ³(__G + e) = k__ βˆ’ 1. In this paper we show that the diameter of a domination __k__‐critical graph with __k__ ≧ 2 is at most 2__k__ βˆ’ 2. We also show that for every __k__ ≧ 2, there is a __k__‐dom

An upper bound for the k-domination numb
An upper bound for the k-domination number of a graph
✍ E. J. Cockayne; B. Gamble; B. Shepherd πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 82 KB πŸ‘ 2 views

The kdomination number of a graph G, y k ( G ) , is the least cardinality of a set U of verticies such that any other vertex is adjacent to at least k vertices of U. We prove that if each vertex has degree at least k. then YAG) 5 kp/(k + 1).