June 10, 2023
Doost Ali Mojdeh

Doost Ali Mojdeh

Degree: Professor
Address: Department of Mathematics, University of Mazandaran, Babolsar, Iran
Education: Ph.D in Mathematics (Graph Theory and Combinatorics)
Phone: 011-35302448
Faculty: Faculty of Mathematical Sciences


Title Efficient k-distance dominating set in Cayley graphs
Type Article
Distance domination, Efficient distance domination, Cayley/circulant graph
Journal Proceedings of the National Academy of Sciences, India Section A: Physical Sciences
DOI https://doi.org/10.1007/s40010-018-0539-x
Researchers Hossein ABDOLLAHZADEH AHANGAR (First researcher) , Doost Ali Mojdeh (Second researcher) , Ashraf Seyed Khalkhali (Third researcher) , Valademir Samodivkin (Fourth researcher)


The efficient k-distance domination number γke(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.