Abstract
All graph in this paper is simple graph. Let G = (V, E) where V is nonempty of vertex set of G and E is possibly empty set of unordered pairs of elements of V. The distance from u to v in G is the lenght of a shortest path joining them, denoted by d(u,v). A function c : V (G) → {1,2,…k} is called a k-packing coloring if every c(u) = c(v) = i and d(u, v) > i + 1. The smallest positive integer of k which has packing coloring is packing chromatic number, denoted by χρ. In this paper, we investigated packing chromatic number of vertex amalgamation of some related tree graph, namely broom graph, star graph, path graph and banana graph.
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 callDisclaimer: 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.
