• THE DOMINATING GRAPH DGabc(G) OF A GRAPH G
Abstract
The dominating graph DGabc(G) of a graph G is obtained from G with vertex set V¢ = V(G) È S, where V = V(G) and S is the set of all minimal dominating sets of G. Then two elements in V¢ are said to satisfy property ‘a’ if u, v Î V and.........
Keywords
dominating set, minimal dominating set, minimal dominating graph.
Full Text:
PDF![Creative Commons License](https://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |