D:\sbornik\...\TPEL.DVI


Mathematical Problems of Computer Science 32, 35{38, 2009.

T he Clique Cover ing N umber for the Str ong P r oduct

of Gener alized Cycles

S e va k H . B a d a lya n

Yerevan State University
sevak badalyan@yahoo.com

Abstract

In this paper the clique covering number for the strong product of generalized cycles
is investigated. A method is given to construct a minimal clique cover in case some
conditions hold.

Refer ences

[1 ] M. R o s e n fe ld ,\ On a p r o b le m o f C. E . S h a n n o n in g r a p h t h e o r y" , P roc. Amer. M ath.
Soc. 18, 3 1 5 -3 1 9 , 1 9 6 7 .

[2 ] R . S . H a le s , \ N u m e r ic a l in va r ia n t s a n d t h e s t r o n g p r o d u c t o f g r a p h s " , Combin. Theory
(B ) 15, 1 4 6 -1 5 5 , 1 9 7 3 .

̳ÍÏáõÛÃÇ ÃÇíÁ ÁݹѳÝñ³óí³Í óÇÏÉ»ñÇ áõÅ»Õ ³ñï³¹ñÛ³ÉÇ Ñ³Ù³ñ

ê. ´³¹³ÉÛ³Ý

²Ù÷á÷áõÙ

êáõÛÝ ³ß˳ï³ÝùáõÙ áõëáõÙݳëÇñí³Í ¿ ÁݹѳÝñ³óí³Í óÇÏÉ»ñÇ áõÅ»Õ ³ñï³¹ñÛ³ÉÇ
ͳÍÏáõÛÃÇ ÃÇíÁ: àñáß å³ÛÙ³ÝÝ»ñÇ ³éϳÛáõÃÛ³Ý ¹»åùáõÙ ïñí³Í ¿ »Õ³Ý³Ï ÙÇÝÇÙ³É
ͳÍÏáõÛÃÁ ϳéáõó»Éáõ ѳٳñ:

3 5