Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physical Sciences and Mathematics
Independent Monopoly Size In Graphs, Ahmed M. Naji, N. D. Soner
Independent Monopoly Size In Graphs, Ahmed M. Naji, N. D. Soner
Applications and Applied Mathematics: An International Journal (AAM)
In a graph G = (V;E), a set D ⊆V (G) is said to be a monopoly set of G if every vertex v ∈V-D has at least d(v)/ 2 neighbors in D. The monopoly size of G, denoted mo(G), is the minimum cardinality of a monopoly set among all monopoly sets in G. The set D ⊆ V (G) is an independent monopoly set in G if it is both a monopoly set and an independent set in G. The number of vertices in a minimum independent monopoly set in a graph G is the independent monopoly size of …