𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connected Domination Number of a Graph and its Complement

✍ Scribed by H. Karami; S. M. Sheikholeslami; Abdollah Khodkar; Douglas B. West

Publisher
Springer Japan
Year
2011
Tongue
English
Weight
229 KB
Volume
28
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The minimum number of subgraphs in a gra
The minimum number of subgraphs in a graph and its complement
✍ Lane Clark πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 265 KB πŸ‘ 2 views

## Abstract For a graphb __F__ without isolated vertices, let __M__(__F__; __n__) denote the minimum number of monochromatic copies of __F__ in any 2‐coloring of the edges of __K__~__n__~. Burr and Rosta conjectured that when __F__ has order __t__, size __u__, and __a__ automorphisms. Independent

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