For a vertex v of a graph G = (V,E), the independent domination number (also called the lower independence number) iv(G) of G relative to v is the minimum cardinality of a maximal independent set in… (More)

In communication networks, ”vulnerability” indicates the resistance of a network to disruptions in communication after a breakdown of some processors or communication links. We may use graphs to… (More)

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… (More)

The problem of quantifying the vulnerability of graphs has received much attention nowadays, especially in the field of computer or communication networks. In a communication network, the… (More)

Let G=(V(G),E(G)) be a graph.A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each vertex of G is dominated by at least k vertices of S. Particularly, if k = 1,… (More)

The fundamental component of a distributed system is the interconnection network. The network topology is significant since the communication between processors is derived via message exchange in… (More)