DOMINATION PARAMETERS IN MYCIELSKI GRAPHS
Bull. Korean Math. Soc.
Published online January 1, 1970
Young Soo Kwon, Jaeun Lee, and Moo Young Sohn
Yeungnam University, Changwon National University
Abstract : In this paper, we consider several domination parameters like perfect domi-
nation number, locating-domination number, open-locating-domination number, etc. in
the Mycielski graph M(G) of a graph G. We found upper bounds for locating-domination
number of M(G) and computational formulae for perfect locating-domination number
and open locating-domination number of M(G). We also showed that the perfect domi-
nation number of M(G) is at least that of G plus 1 and that for each positive integer n,
there exists a graph Gn such that the perfect domination number of M(Gn) is equal to
that of Gn plus n.
Keywords : Mycielski graph, domination number
MSC numbers : 05C69
Full-Text :

   

Copyright © Korean Mathematical Society. All Rights Reserved.
The Korea Science Technology Center (Rm. 411), 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail: paper@kms.or.kr   | Powered by INFOrang Co., Ltd