Subscribe

Subscribe to our Newsletter and get informed about new publication regulary and special discounts for subscribers!

BMSA > Volume 9 > Locating Equitable Domination and Independence...
< Back to Volume

Locating Equitable Domination and Independence Subdivision Numbers of Graphs

Download PDF

Abstract:

Let G = (V,E) be a simple, undirected, finite nontrivial graph. A non empty set DV of vertices in a graph G is a dominating set if every vertex in V-D is adjacent to some vertex in D. The domination number (G) is the minimum cardinality of a dominating set of G. A dominating set D is a locating equitable dominating set of G if for any two vertices u,wєV-D, N(u)∩D ≠ N(w)∩D, |N(u)∩D| ≠ |N(w)∩D|. The locating equitable domination number of G is the minimum cardinality of a locating equitable dominating set of G. The locating equitable domination subdivision number of G is the minimum number of edges that must be subdivided (where each edge in G can be subdivided at most once) in order to increase the locating equitable domination number and is denoted by sdγle(G). The independence subdivision number sdβle(G) to equal the minimum number of edges that must be subdivided in order to increase the independence number. In this paper, we establish bounds on sdγle(G) and sdβle(G) for some families of graphs.

Info:

Periodical:
Bulletin of Mathematical Sciences and Applications (Volume 9)
Pages:
27-32
DOI:
10.18052/www.scipress.com/BMSA.9.27
Citation:
P. Sumathi and G. Alarmelumangai, "Locating Equitable Domination and Independence Subdivision Numbers of Graphs", Bulletin of Mathematical Sciences and Applications, Vol. 9, pp. 27-32, 2014
Online since:
Aug 2014
Export:
Distribution: