Decomposing certain equipartite graphs into sunlet graphs of length

详细信息    查看全文

• 作者：Abolape D. Akwu^a ; ^{abolapeyemi@yahoo.co.uk} ; Deborah Olayide A. Ajayi^b ; ^{adelaideajayi@yahoo.com} ; ^{olayide.ajayi@ui.edu.ng}
• 关键词：Graph decomposition ; Corona graph ; Lexicographic product ; Equipartite graph ; Sunlet graph
• 刊名：AKCE International Journal of Graphs and Combinatorics
• 出版年：2016
• 出版时间：December 2016
• 年：2016
• 卷：13
• 期：3
• 页码：267-271
• 全文大小：199 K
• 卷排序：13

文摘

For any integer r≥3r≥3, we define the sunlet graph of order 2r2r, denoted L2rL2r, as the graph consisting of a cycle of length rr together with rr pendant vertices, each adjacent to exactly one vertex of the cycle. In this paper, we give necessary and sufficient conditions for decomposing the lexicographic product of the complete graph and the complete graph minus a 1-factor, with complement of the complete graph KmKm, (that is Kn⊗K̄m and Kn−I⊗K̄m, respectively) into sunlet graphs of order twice a prime.