Bi-efficient domination in graphs
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In a graph G = (V, E), a dominating set D ⊆ V is a bi-efficient dominating set of G, if for every vertex u in V, N[u]∩D =2. The bi-efficient domination number of G, denoted by γbe(G) is the minimum cardinality of a bi-efficient dominating set of G. In this paper, many bounds of γbe(G) are obtained and its exact values for some standard graphs are found. Also its relationship with other parameters is investigated.
Abstract
In a graph G = (V, E), a dominating set D ⊆ V is a bi-efficient dominating set of G, if for every vertex u in V, N[u]∩D =2. The bi-efficient domination number of G, denoted by γbe(G) is the minimum cardinality of a bi-efficient dominating set of G. In this paper, many bounds of γbe(G) are obtained and its exact values for some standard graphs are found. Also its relationship with other parameters is investigated.