Let G = (V (G),E(G)) be a simple graph. A subset S of V (G) is a dominating set of G if, for any vertex v ∈ V (G) — S, there exists some vertex u ∈ S such that uv ∈ E(G). The domination number, denoted by γ(G), is the cardinality of a minimal dominating set of G. There are several types of domination parameters depending upon the nature of domination and the nature of dominating set. These parameters are bondage, reinforcement, strong-weak domination, strong-weak bondage numbers. In this paper, we first investigate the strong-weak domination number of middle graphs of a graph. Then several results for the bondage, strong-weak bondage number of middle graphs are obtained.
1 September 2015 in International Journal of Foundations of Computer Science
The domination number is an important subject that it has become one of the most widely studied topics in graph theory, and also is the most often studied property of vulnerability of communication networks. The vulnerability value of a communication network shows the resistance of the network after the disruption of some centers or connection lines until a communication breakdown. Let G = (V(G),E(G)) be a simple graph. The bondage number b(G) of a nonempty graph G is the smallest number of edges whose removal from G result in a graph with domination number greater than that of G. If we think a graph as a modeling of network, the average lower bondage number of a graph is a new measure of the graph vulnerability and it is defined by bav(G) = 1/|E(G)| ∑ e∈E(G) b e (G), where the lower bondage number, denoted by b e (G), of the graph G relative to e is the minimum cardinality of bondage set in G that contains the edge e. In this paper, the above mentioned new parameter has been defined and examined. Then upper bounds, lower bounds and exact formulas have been obtained for any graph G. Finally, the exact values have been determined for some well-known graph families.
1 October 2015 in Journal of Computational and Theoretical Nanoscience
Let G = ( V ( G), E( G)) be a simple undirected graph. The domination and average lower domination numbers are vulnerability parameters of a graph. We have investigated a refinement that involves the residual domination and average lower residual domination numbers of these parameters. The lower residual domination number, denoted by [ ], is the minimum cardinality of dominating set in G that received from the graph G where the vertex vk and all links of the vertex vk are deleted. The residual domination number of graphs G is defined as [ ]. The average lower residual domination number of G is defined by [ ]. In this paper, we define the residual domination and the average lower residual domination numbers of a graph and we present the exact values, upper and lower bounds for some graph families.