Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)
ÇѱÛÁ¦¸ñ(Korean Title) |
¿¡Áö¿¡ °íÀåÀÌ ÀÖ´Â À̺б׷¡ÇÁ°¡ ¾Æ´Ñ k-ary n-cubeÀÇ ÀÏ´ëÀÏ ¼·Î¼ÒÀÎ °æ·ÎÄ¿¹ö |
¿µ¹®Á¦¸ñ(English Title) |
One-to-One Disjoint Cover of Non-bipartite k-ary n-cube with Faulty Edges |
ÀúÀÚ(Author) |
±èÈñö
Á¶»ó¿µ
½ÅÂù¼ö
Hee-Chul Kim
Sang-Young Cho
Chan-Su Shin
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 48 NO. 12 PP. 1251 ~ 1273 (2021. 12) |
Çѱ۳»¿ë (Korean Abstract) |
±×·¡ÇÁ G¿¡¼ ¼Ò½º Á¤Á¡ s, ½ÌÅ© Á¤Á¡ t¸¦ ÀÕ´Â ÀÏ´ëÀÏ ¼·Î¼ÒÀÎ r-°æ·ÎÄ¿¹ö´Â s ¿Í t ¸¦ ÀÕ´Â r °³ÀÇ °æ·Îµé·Î¼ ÀÌµé °æ·Î°¡ GÀÇ ¸ðµç Á¤Á¡µéÀ» Áö³ª¸é¼ s ¿Í t ¸¦ Á¦¿ÜÇÑ ´Ù¸¥ Á¤Á¡Àº Áߺ¹Çؼ Áö³ªÁö ¾Ê´Â °ÍÀÌ´Ù. ÀÌ ³í¹®¿¡¼´Â »óÈ£¿¬°á¸ÁÀ¸·Î Àß ¾Ë·ÁÁø k-ary n-cube Q¿¡¼ ¿¡Áö¿¡ °íÀåÀÌ ÀÖ´Â °æ¿ì¿¡ ÀÏ´ëÀÏ ¼·Î¼ÒÀÎ °æ·ÎÄ¿¹ö ¹®Á¦¸¦ °í·ÁÇÑ´Ù. n ¡Ã 3ÀÌ°í, k °¡ 3 ÀÌ»ó Ȧ¼ö(À̺Р±×·¡ÇÁ°¡ ¾Æ´Ñ)ÀÎ Q ¿¡¼ °íÀåÀÎ ¿¡Áöµé °³¼ö f°¡ 2n-3 ÀÌÇÏÀÏ ¶§, f+r ¡Â 2n ÀÎ ¸ðµç r ¿¡ ´ëÇÏ¿© ÀÓÀÇÀÇ µÎ Á¤Á¡À» ÀÕ´Â ÀÏ´ëÀÏ ¼·Î¼ÒÀÎ r-°æ·ÎÄ¿¹ö°¡ Á¸ÀçÇÔÀ» º¸ÀδÙ. f+r ¿¡ ´ëÇÑ »óÇÑ 2n Àº ÃÖ¼±ÀÇ »óÇÑÀÌ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
Given a graph G, a source s, and a sink t, one-to-one r-disjoint path cover joining s and t is a set of r internally vertex disjoint paths joining s and t which cover all vertices in G. In this paper, we consider one-to-one disjoint path cover problem in the k-ary n-cube with faulty edges which is one of the well-known interconnection networks. It is shown that in non-bipartite k-ary n-cube Q with n ¡Ã 2, k ¡Ã 3, and f faulty edges where f ¡Â 2n-3, there is one-to-one r-disjoint path cover joining any two vertices for any r with f r ¡Â 2n. The upper bound, 2n, on f r is the best possible. |
Å°¿öµå(Keyword) |
ÀÏ´ëÀÏ ¼·Î¼ÒÀÎ °æ·ÎÄ¿¹ö
»óÈ£¿¬°á¸Á
k-ary n-cubes
°íÀå °¨³»
one-to-one disjoint path cover
interconnection networks
k-ary n-cubes
fault tolerance
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|