2 research outputs found
Packing coloring of generalized Sierpinski graphs
The packing chromatic number of a graph is the smallest
integer such that the vertex set can be partitioned into sets , with the condition that vertices in have pairwise distance
greater than . In this paper, we consider the packing chromatic number of
several families of Sierpinski-type graphs. We establish the packing chromatic
numbers of generalized Sierpinski graphs where is a path or a cycle
(with exception of a cycle of length five) as well as a connected graph of
order four. Furthermore, we prove that the packing chromatic number in the
family of Sierpinski-triangle graphs is bounded from above by 20
Packing coloring of generalized Sierpinski graphs
The packing chromatic number of a graph is the smallestinteger such that the vertex set can be partitioned into sets , with the condition that vertices in have pairwise distancegreater than . In this paper, we consider the packing chromatic number ofseveral families of Sierpinski-type graphs. We establish the packing chromaticnumbers of generalized Sierpinski graphs where is a path or a cycle(with exception of a cycle of length five) as well as a connected graph oforder four. Furthermore, we prove that the packing chromatic number in thefamily of Sierpinski-triangle graphs is bounded from above by 20