Open AccessOn the packing chromatic number of vertex amalgamation of some related tree graph
Author(s) -
S. M. Citra,
Arika Indah Kristiana,
Robiatul Adawiyah,
Dafik Dafik,
R. M. Prihandini
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1836/1/012025
Subject(s) - combinatorics , windmill graph , mathematics , vertex (graph theory) , graph , wheel graph , graph power , neighbourhood (mathematics) , bound graph , discrete mathematics , line graph , mathematical analysis
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.