Maximum Pair-wise Domination Number
Makaleler > Tam Makale · 2015
Yazarlar: Mehmet Ali Balcı, Elgin KILIÇ
Asian journal of mathematics and applications, Uluslararası, 2015, cilt 2015
Özet
Let G be a connected, undirected graph without loops and multiple edges. In network design graph models are extensively used. Each vertex of a graph represents a computer in the network. Data transition has a great importance in any network. In general there are main server computers which keeps all data and send it to other computers in network. It is quite important where to locate the main server and how to take its backup. To decrease the loss of data in any failure, the location of main server and backup should be done carefully. This location process corresponds to another type of domination in the graph model of the network. The vertex which the main server is located should be adjacent to the vertex which backup is located. The connection of these two vertices with other vertices of the graph is expected to be maximum. For a pair of vertices u and v the set of vertices which dominates both these u and v is called a pairwise dominating set. The cardinality of this set is called pairwise domination value of this uv pair. And among all pair of vertices of the graph the maximum pairwise domination value is called the maximum pair-wise domination number of G.