PARTITIONING A GRAPH INTO MONOPOLY SETS
In a graph G = (V, E), a subset M of V (G) is said to be a monopoly set of G if every vertex v ∈ V - M has, at least, d(v)/ 2 neighbors in M. The monopoly size of G, denoted by mo(G), is the minimum cardinality of a monopoly set. In this paper, we study the problem of partitioning V (G) into monopol...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Isik University
2017-06-01
|
| Series: | TWMS Journal of Applied and Engineering Mathematics |
| Subjects: | |
| Online Access: | http://jaem.isikun.edu.tr/web/index.php/current/93-vol7no1/287-partitioning-a-graph-into-monopoly-sets |