On certain graph domination numbers and applications
by V. Yegnanarayanan; Valentina E. Balas; G. Chitra
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 6, No. 2, 2014

Abstract: In this paper, we compute for paths and cycles certain graph domination invariants like locating domination number, differentiating domination number, global alliance number, etc. We also do some comparison analysis of certain parameters defined by combining the domination measures and the second smallest eigen value of the Laplacian matrix of all connected graphs of order 4. While discussing applications we have pointed out the crucial role played by graphs through its hard core structural properties in wireless sensor networks (WSN).

Online publication date: Sat, 28-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com