ALGORITHMS TO DETERMINE THE INDEPENDENT, EFFICIENT AND PAIRED DOMINATING SETS OF THE EXTENDED STAR GRAPH

##plugins.themes.bootstrap3.article.main##

##plugins.themes.bootstrap3.article.sidebar##

Published Oct 4, 2013
M. Evangeline Prathibha Fernando A. Anto Kinsley, S. Pious Missier,

Abstract

Dominating sets are important tools used in the allocation of finite resources to massively parallel architectures.  The independent dominating sets, perfect dominating sets and paired dominating sets are used in assigning backups, transmitting codes and also in communication networks.  We have designed algorithms to determine the above mentioned dominating sets using the hierarchical levels of the Extended Star Graph to our advantage rather than the conventional method of studying individual nodes and their neighbouring sets

How to Cite

ALGORITHMS TO DETERMINE THE INDEPENDENT, EFFICIENT AND PAIRED DOMINATING SETS OF THE EXTENDED STAR GRAPH. (2013). Asian Journal of Current Engineering and Maths, 2(5). http://informaciontechnologica.com/index.php/ajcem/article/view/48
Abstract 184 | PDF Downloads 0

##plugins.themes.bootstrap3.article.details##

Section
Articles

How to Cite

ALGORITHMS TO DETERMINE THE INDEPENDENT, EFFICIENT AND PAIRED DOMINATING SETS OF THE EXTENDED STAR GRAPH. (2013). Asian Journal of Current Engineering and Maths, 2(5). http://informaciontechnologica.com/index.php/ajcem/article/view/48