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

Cite this:
S. Pious Missier, M. E. P. F. A. A. K. (2013). ALGORITHMS TO DETERMINE THE INDEPENDENT, EFFICIENT AND PAIRED DOMINATING SETS OF THE EXTENDED STAR GRAPH. Asian Journal of Current Engineering and Maths, 2(5). Retrieved from http://innovativejournal.in/index.php/ajcem/article/view/48
© 2022 Interactive Protocols
RIGHTS & PERMISSIONS
Article Views
183
Altmetric
1
Citations
-
LEARN ABOUT THESE METRICS
   PDF  

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

KEYWORDS:

 Special Issue

Article Metrics Graph

Chart Graph | Range Graph

Content

Section

Source

License

COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY

 

All paper submissions must carry the following duly signed by all the authors:

“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.”