Journal of applied mathematics & informatics
- 제26권5_6호
- /
- Pages.1085-1100
- /
- 2008
- /
- 2734-1194(pISSN)
- /
- 2234-8417(eISSN)
DOMINATION IN GRAPHS WITH MINIMUM DEGREE SIX
- Jianxiang, Cao (Communication University of China) ;
- Minyong, Shi (Communication University of China) ;
-
Sohn, Moo-Young
(Department of Applied Mathematics, Changwon National University) ;
- Xudong, Yuan (Guangxi Normal University)
- 발행 : 2008.09.30
초록
A set D of vertices of a graph G = (V(G),E(G)) is called a dominating set if every vertex of V(G) - D is adjacent to at least one element of D. The domination number of G, denoted by