Abstract

Let $K_n,$ $C_{n}$, and $P_{n}$ respectively denote the complete graph, cycle and path on $n$ vertices. Uniformly resolvable decomposition of $K_n$ is a decomposition of $K_n$ into subgraphs which can be partitioned into factors containing pairwise isomorphic subgraphs. In this paper, we determine necessary and sufficient conditions for the existence of uniformly resolvable decomposition of $K_n$ into $P_4$ and $C_k,~ k\geq3.$

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.