Isolate domination in graphs
A set D of vertices of a graph G is called a dominating set of G if every vertex in V(G)−D is adjacent to a vertex in D. A dominating set S such that the subgraph 〈S〉 induced by S has at least one isolated vertex is called an isolate dominating set. An isolate dominating set none of whose proper sub...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Emerald Publishing
2016-07-01
|
| Series: | Arab Journal of Mathematical Sciences |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1319516615000316 |