๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

What is the difference between the domination and independent domination numbers of a cubic graph?

โœ Scribed by Curtiss Barefoot; Frank Harary; Kathryn F. Jones

Publisher
Springer Japan
Year
1991
Tongue
English
Weight
203 KB
Volume
7
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

The sequence of upper and lower dominati
The sequence of upper and lower domination, independence and irredundance numbers of a graph
โœ E.J. Cockayne; C.M. Mynhardt ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 803 KB

Necessary and sufficient conditions are established for the existence of a graph whose upper and lower domination, independence and irredundance numbers are six given positive integers. This result shows that the only relationships between these six parameters which hold for all graphs and which do