Packing Chromatic Number of Bismuth Tri-iodide and First type Nanostar Dentrimers

Abstract

The packing chromatic number of a graph is the smallest integer for which there exists a mapping such that any two vertices of color are at distance at least . In this paper we determine the packing chromatic numbers of bismuth tri-iodide and first type nanostar dentrimers.