Some notes on the isolate domination in graphs
A subset of vertices of a graph is a dominating set of if every vertex in has a neighbor in . The domination number is the minimum cardinality of a dominating set of . A dominating set is an isolate dominating set if the induced subgraph has at least one isolated vertex. The isolate domination numbe...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.01.003 |