ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Discussiones Mathematicae Graph Theory 26(1) (2006)
D. Ali Mojdeh
Department of Mathematics
University of Mazandaran
Babolsar, IRAN, P.O. Box 47416-1467
The d(G = Cm ×Kn, χ(G))
has been studied. In this note we
show that the exact value of defining number d(G = Cm×Kn,c) with
c > χ(G), where n ≥
2 and m ≥ 3, unless the defining number
d(K3×C2r,4), which is given an upper and lower bounds for this
defining number. Also some bounds of defining number are introduced.
Keywords: graph coloring, defining set, cartesian product.
2000 Mathematics Subject Classification: 05C15, 05C38.
Received 6 November 2004
Revised 13 September 2005