Journal of Combinatorics, Information & System Sciences : (A Quarterly International Scientific Journal)
Published in Association with Forum for Interdisciplinary Mathematics
Current Volume: 47 (2022 )
ISSN: 0250-9628
e-ISSN: 0976-3473
Periodicity: Quarterly
Month(s) of Publication: March, June, September & December
Subject: Mathematics
DOI: 10.32381/JCISS
Online Access is free for all life members of JCISS.
Packing Copies of Cartesian Product of Certain Classes of Paths and Cycles into Power graphs
By : Sriram. V., Medha Itagi Huilgol
Page No: 79-91
Abstract
An H -packing of a graph G is a set L = {H1,H2,...,Ht} of edge-disjoint subgraphs of G, where each subgraph Hi is isomorphic to H. In this paper, we have proved (CmCn)|(CmCn)k for m, n ? 2k – 1, with m, n, relatively prime to all numbers less than or equal to k and for the particular cases of m, n ? 0, 2 or 4(mod 6), n ? 8, we have (CmCn)|(CmCn)3 . Also we have found the maximum possible packing of PnCm in (PnCm)3 for n ? 4 and m ? 3 when m is even.
Authors :
Medha Itagi Huilgol : Department of Mathematics Bangalore University, Bengaluru, India
Sriram. V : Department of Mathematics, M.E.S. Degree College, Bengaluru, India
DOI: https://doi.org/10.32381/JCISS.2018.43.1-4.5