• P-ISSN 0974-6846 E-ISSN 0974-5645

Indian Journal of Science and Technology


Indian Journal of Science and Technology

Year: 2021, Volume: 14, Issue: 23, Pages: 1975-1981

Original Article

On Packing Colouring of Transformation of Path, Cycle and Wheel Graphs

Received Date:08 April 2021, Accepted Date:21 April 2021, Published Date:09 July 2021


Objectives: To compute the packing chromatic number of transformation of path graph, cycle graph and wheel graph. Methods: The packing chromatic number of  Xpc (H) of a graph H is the least integer m  in such a way that there is a mapping C: V(H)→(1,2,…,m} such that the distance between any two nodes of colour k is greater than k+1Findings: The packing chromatic number of the transformation of the graph Xpc (Hpqr) where p,q,r be variables which has the values either positive sign (+)or a negative sign (-) then Hpqr is known as the transformation of the graph H such that VH
 and E(H) belonging to the vertex set of Hpqr and α(H), β(H) also belonging to V(H), E(H) of the graph. Obtained the values of the packing chromatic number of transformation of path graph, cycle graph and wheel graph. Applications: Chromatic number applied in Register Allocations, a compiler is a computer program that translates one computer language into another. To improve the execution time of the resulting code, one of the techniques of compiler optimization is register allocation; if the graph can be colored with k colors then the variables can be stored in k registers.


path graph, cycle graph, wheel graph, packing chromatic number


  1. Vizing VG. Cartesian product of graphsVychisl. Sistemy1963;9:3043. Available from: 10.4236/ojdm.2015.54008
  2. William A, Roy S. Packing Chromatic numbers of Certain GraphsInternational Journal of Pure and Apllied Mathematics2013;87(6):731739. Available from: https://dx.doi.org/10.12732/ijpam.v87i6.1
  3. Brešar B, Zmazek B. On the independence graph of a graphDiscrete Mathematics2003;272(2-3):263268. Available from: https://dx.doi.org/10.1016/s0012-365x(03)00194-8
  4. Durgun DD, Dortok HBO. Packing chromatic number of transformation graphsThermal science2019;23(6):S1991S1995. Available from: http://www.doiserbia.nb.rs/img/doi/0354-9836/2019/0354-98361900363D.pdf
  5. Brešar B, Klavžar S, Rall DF. On the packing chromatic number of Cartesian products, hexagonal lattice, and treesDiscrete Applied Mathematics2007;155(17):23032311. Available from: https://dx.doi.org/10.1016/j.dam.2007.06.008
  6. Božović D, Peterin I. A note on the packing chromatic number of lexicographic productsDiscrete Applied Mathematics2021;293:3437. Available from: https://dx.doi.org/10.1016/j.dam.2021.01.010
  7. Baoyindureng W, Jixiang M. Basic Properties of Total Transformation GraphsJournal of Mathematical Study2001;34.


© 2021 Srinivasan & Vivekanandan. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Published By Indian Society for Education and Environment (iSee)


Subscribe now for latest articles and news.