No Detail Found!

Decomposition of complete graphs into paths and cycles of distinct lengths

Author(s)
C. Sankari Department of Mathematics, A. V. V. M. Sri Pushpam College (Affiliated to Bharathidasan University), Poondi-613 503, Thanjavur (Dt.), Tamil Nadu, India.
R. Sangeetha Department of Mathematics,A. V. V. M. Sri Pushpam College (Affiliated to Bharathidasan University), Poondi-613 503, Thanjavur (Dt.), Tamil Nadu, India.
K. Arthi Department of Mathematics, A. V. V. M. Sri Pushpam College (Affiliated to Bharathidasan University), Poondi-613 503, Thanjavur (Dt.), Tamil Nadu, India.
Abstract
: Let Pk be the path with k edges and Ck be the cycle with k edges. For r = 3, we exhibit two decompositions of the complete graph K2r+3 into edge-disjoint paths and cycles: the first is of the form ?P3, P4, C5, C6, ..., C2r 1, C2r+1, C2r+2, C2r+3? and the second ?P3, P4, P5, C6, ..., C2r 1, C2r+1, C2r+2, C2r+3?.
Publication Details
Page(s) 5-6
DOI DOI not available
Published Journal: Punjab University Journal of Mathematics, Volume: 55, Issue: 5--6, Year: 2023

Request the full text from PASTIC

Keywords
Decomposition, Path, Complete Graph, Cycle.
0

Citations

0

Downloads

69

Views