Let G be a graph and τ : V (G) → N be an assignment of thresholds to the vertices of G. A subset of vertices D is said to be dynamic monopoly (or simply dynamo) if the vertices of G can be partitioned into subsets D 0 , D 1 , . . . , D k such that D 0 = D and for any i = 1, . . . , k − 1 each vertex v in D i+1 has at least t(v) neighbors in D 0 ∪. . . ∪D i . Dynamic monopolies are in fact modeling the irreversible spread of influence such as disease or belief in social networks. We denote the smallest size of any dynamic monopoly of G, with a given threshold assignment, by dyn(G). In this paper we first define the concept of a resistant subgraph and show its relationship with dynamic monopolies. Then we obtain some lower and upper bounds for the smallest size of dynamic monopolies in graphs with different types of thresholds. Next we introduce dynamo-unbounded families of graphs and prove some related results. We also define the concept of a homogenious society that is a graph with probabilistic thresholds satisfying some conditions and obtain a bound for the smallest size of its dynamos. Finally we consider dynamic monopoly of line graphs and obtain some bounds for their sizes and determine the exact values in some special cases.Mathematics Subject Classification: 05C35, 91D10, 91D30, 68R10.
The Grundy number of a graph G is the maximum number of colors used by the First-Fit coloring of G and is denoted by Γ(G). Similarly, the bchromatic number b(G) of G expresses the worst case behavior of another well-known coloring procedure i.e. color-dominating coloring of G. We obtain some families of graphs F for which there exists a function f (x) such that Γ(G) ≤ f (b(G)), for each graph G from the family. Call any such family (Γ, b)-bounded family. We conjecture that the family of b-monotone graphs is (Γ, b)-bounded and validate the conjecture for some families of graphs.
In this paper we obtain some upper bounds for b-chromatic number of K 1,t -free graphs, graphs with given minimum clique partition and bipartite graphs. These bounds are in terms of either clique number or chromatic number of graphs or biclique number for bipartite graphs. We show that all the bounds are tight.
Let G be a graph and τ : V (G) → N ∪ {0} be an assignment of thresholds to the vertices of G. A subset of vertices D is said to be a dynamic monopoly corresponding to (G, τ ) if the vertices of G can be partitioned into subsets D 0 , D 1 , . . . , D k such that D 0 = D and for any i ∈ {0, . . . , k − 1}, each vertex v in D i+1 has at least τ (v) neighbors in D 0 ∪ . . . ∪ D i . Dynamic monopolies are in fact modeling the irreversible spread of influence in social networks. In this paper we first obtain a lower bound for the smallest size of any dynamic monopoly in terms of the average threshold and the order of graph. Also we obtain an upper bound in terms of the minimum vertex cover of graphs. Then we derive the upper bound |G|/2 for the smallest size of any dynamic monopoly when the graph G contains at least one odd vertex, where the threshold of any vertex v is set as ⌈(deg(v) + 1)/2⌉ (i.e. strict majority threshold). This bound improves the best known bound for strict majority threshold. We show that the latter bound can be achieved by a polynomial time algorithm. We also show that α ′ (G) + 1 is an upper bound for the size of strict majority dynamic monopoly, where α ′ (G) stands for the matching number of G. Finally, we obtain a basic upper bound for the smallest size of any dynamic monopoly, in terms of the average threshold and vertex degrees. Using this bound we derive some other upper bounds.Mathematics Subject Classification: 91D30, 05C85, o5C69.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.