1. Efficient open domination in Cayley graphs
- Author
-
T. Tamizh Chelvam and Sivagnanam Mutharasu
- Subjects
Theoretical computer science ,Cayley graph ,Applied Mathematics ,Efficient open domination ,Cayley graphs ,Combinatorics ,Indifference graph ,Harary graphs ,Covering projection ,Dominating set ,Chordal graph ,Bipartite graph ,Circulant matrix ,MathematicsofComputing_DISCRETEMATHEMATICS ,Mathematics - Abstract
Efficient open dominating sets in bipartite Cayley graphs are characterized in terms of covering projections. Necessary and sufficient conditions for the existence of efficient open dominating sets in certain circulant Harary graphs are given. Chains of efficient dominating sets, and of efficient open dominating sets, in families of circulant graphs are described as an application.
- Published
- 2012
- Full Text
- View/download PDF