期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2017
卷号：14
期号：1
页码：54-62
DOI：10.1016/j.akcej.2016.11.002
语种：English
出版社：Elsevier
摘要：Abstract For any graph G , let G ∗ be the symmetric digraph obtained from G by replacing every edge with a pair of symmetric arcs. In this paper, we show that the necessary and sufficient condition for the existence of an S ¯ k -factorization in ( C m ∘ K ¯ n ) ∗ is n ≡ 0 ( mod k ( k − 1 ) 2 ) , where k > 3 is odd. In fact, our result deduces the result of Ushio on symmetric complete tripartite digraphs as a corollary. Further, a necessary condition and some sufficient conditions for the existence of an S ¯ k -factorization in K n 1 , n 2 , … , n m ∗ are obtained.
关键词：Keywordsen S ¯ k -factorizationWreath product of graphsComplete multipartite symmetric digraphs
