Efficient k-Distance Dominating Set in Cayley Graphs

Ahangar, H.A.; Mojdeh, D.A.; Sayed-Khalkhali, A.; Samodivkin, V.; Ahangar, H.A; Mojdeh, D.A; Sayed-Khalkhali, A; Samodivkin, V

doi:10.1007/s40010-018-0539-x

Home

>

Section

>

Chapter

Efficient k-Distance Dominating Set in Cayley Graphs

Ahangar, H.A.; Mojdeh, D.A.; Sayed-Khalkhali, A.; Samodivkin, V.

Proceedings of the National Academy of Sciences India Section A - Physical Sciences 90(1): 141-147

2020

ISSN/ISBN: 0369-8203

DOI: 10.1007/s40010-018-0539-x
Accession: 102752207

Full-Text Article emailed within 0-6 h

Payments are secure & encrypted

Summary

The efficient k-distance domination number γek(G) is the minimum among the cardinalities of efficient k-distance dominating sets of G. Upper bound in terms of order and maximum degree of an independent set S of vertices in a graph G= (V, E) called an efficient k-distance dominating set if every vertex in V- S be distance k from exactly one vertex in S has been presented. Sufficient conditions for 3-regular Cayley graphs to have disjoint efficient k-distance dominating sets are given. Characterization of the 3-regular connected circulant graphs that admit an efficient k-distance dominating set for k= 2 , 3 has been obtained.

Efficient k-Distance Dominating Set in Cayley Graphs

Ahangar, H.A.; Mojdeh, D.A.; Sayed-Khalkhali, A.; Samodivkin, V.

Proceedings of the National Academy of Sciences India Section A - Physical Sciences 90(1): 141-147

2020

Full-Text Article emailed within 0-6 h

Summary

References