𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The cototal domination number of a graph

✍ Scribed by Kulli, V. R.; Janakiram, B.; Iyer, Radha R.

Book ID
120618876
Publisher
Informa UK (Taylor & Francis)
Year
1999
Tongue
English
Weight
271 KB
Volume
2
Category
Article
ISSN
0972-0529

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds on the -domination number of a gr
Bounds on the -domination number of a graph
✍ Ermelinda DeLaViΓ±a; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 200 KB

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part

On the r-domination number of a graph
On the r-domination number of a graph
✍ Jerrold R. Griggs; Joan P. Hutchinson πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 468 KB

For r > 0, let the r-domination number of a graph, d,, be the size of a smallest set of vertices such that every vertex of the graph is within distance r of a vertex in that set. This paper contains proofs that every graph with a spanning tree with at least n/2 leaves has d, s n/(2r); this compares

The difference between the domination nu
The difference between the domination number and the minus domination number of a cubic graph
✍ Xiaofan Yang; Qibin Hou; Xiangsheng Huang; Hengnong Xuan πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 325 KB

The closed neighborhood of a vertex subset S of a graph G = (V,E), denoted as N[Sj, is defined ss the union of S and the set of all the vertices adjacent to some vertex of S. A dominating set of a graph G = (V, E) is defined as a set S of vertices such that N[q = V. The domination number of a graph