In this paper, we study the strong connectivity of Cayley color graphs when a certain number of vertices are removed. We prove that there are \Delta\ vertex-disjoint paths from every vertex to every other vertex in a Cayley color graph associated with a finite group Gamma and a non redundant generating set Delta for Gamma. We also extend this result to a certain class of Cayley graphs.
机构:
Univ Sci & Technol China, Hefei 230026, Anhui, Peoples R ChinaUniv Sci & Technol China, Hefei 230026, Anhui, Peoples R China
Guo, W.
Lytkina, D., V
论文数: 0引用数: 0
h-index: 0
机构:
Siberian State Univ Telecommun & Informat Sci, Ul Kirova 86, Novosibirsk 630102, Russia
Novosibirsk State Univ, Ul Pirogova 1, Novosibirsk 630090, RussiaUniv Sci & Technol China, Hefei 230026, Anhui, Peoples R China
Lytkina, D., V
Mazurov, V. D.
论文数: 0引用数: 0
h-index: 0
机构:
Novosibirsk State Univ, Ul Pirogova 1, Novosibirsk 630090, Russia
Sobolev Inst Math, Pr Akad Koptyuga 4, Novosibirsk 630090, RussiaUniv Sci & Technol China, Hefei 230026, Anhui, Peoples R China
Mazurov, V. D.
Revin, D. O.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Sci & Technol China, Hefei 230026, Anhui, Peoples R China
Novosibirsk State Univ, Ul Pirogova 1, Novosibirsk 630090, Russia
Sobolev Inst Math, Pr Akad Koptyuga 4, Novosibirsk 630090, RussiaUniv Sci & Technol China, Hefei 230026, Anhui, Peoples R China