Partitioning a graph into monopoly sets

In a graph G = (V, E), a set M ⊆ 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 monopoly sets. An M-partition of a graph G is the partition of V (G) into k disjoint monopoly sets. The monatic number of G, denoted by µ(G), is the maximum number of sets in M-partition of G. It is shown that 2 ≤ µ(G) ≤ 3 for every graph G without isolated vertices. The properties of each monopoly partite set of G are presented. Moreover, the properties of all graphs G having µ(G) = 3, are presented. It is shown that every graph G having µ(G) = 3 is Eulerian and have χ(G) ≤ 3. Finally, it is shown that for every integer k /∈ {1, 2, 4}, there exists a graph G of order n = k having µ(G) = 3.Publisher's Versio

Leap Eccentric Connectivity Index of Subdivision Graphs

The second degree of a vertex in a simple graph is defined as the number of its second neighbors. The leap eccentric connectivity index of a graph M, L xi(c)(M), is the sum of the product of the second degree and the eccentricity of every vertex in M. In this paper, some lower and upper bounds of L xi(c)(S(M)) in terms of the numbers of vertices and edges, diameter, and the first Zagreb and third leap Zagreb indices are obtained. Also, the exact values of L xi(c)(S(M)) for some well-known graphs are computed