For a graph G, a subset D of V(G) is called an efficient dominating set of G if D is an independent set and every vertex in V(G) \ D is adjacent to exactly one vertex in the set D. In this paper, we give necessary and sufficient conditions for the existence of efficient dominating sets of circulant graphs of degree 5 and classify these sets.
机构:
Univ Johannesburg, Dept Math & Appl Math, ZA-2006 Auckland Pk, South AfricaUniv Johannesburg, Dept Math & Appl Math, ZA-2006 Auckland Pk, South Africa
Henning, Michael A.
Topp, Jerzy
论文数: 0引用数: 0
h-index: 0
机构:
State Univ Appl Sci, PL-82300 Elblag, PolandUniv Johannesburg, Dept Math & Appl Math, ZA-2006 Auckland Pk, South Africa
机构:
Univ Stellenbosch, Dept Logist, Private Bag X1, ZA-7602 Matieland, South AfricaUniv Stellenbosch, Dept Logist, Private Bag X1, ZA-7602 Matieland, South Africa
Burger, A. P.
de Villiers, A. P.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Stellenbosch, Dept Ind Engn, Private Bag X1, ZA-7602 Matieland, South AfricaUniv Stellenbosch, Dept Logist, Private Bag X1, ZA-7602 Matieland, South Africa
de Villiers, A. P.
van Vuuren, J. H.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Stellenbosch, Dept Ind Engn, Private Bag X1, ZA-7602 Matieland, South AfricaUniv Stellenbosch, Dept Logist, Private Bag X1, ZA-7602 Matieland, South Africa