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

Year 2019, Volume: 32 Issue: 2, 667 - 672, 01.06.2019

Roy Santıago

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.

Keywords

Packing coloring , Bismuth tri-iodide , Lead chloride

References

• [1] B. Bres ̌ar, S. Klavz ̌ar, and D. F. Rall, On the Packing Chromatic Number of Cartesian Products, Hexagonal Lattice and Trees, Discrete Appl. Math., 155 (17), 2303 – 2311, (2007).
• [2] W. Goddard, S. M. Hedetniemi, S. T. Hedetniemi, J. M. Harris, and D. F. Rall, “Broadcast Chromatic Numbers of Graphs", Ars Combin., 86, 33 – 49, (2008).
• [3] S. Krishnan and B. Rajan, Fault-Tolerant Resolvability of Certain Crystal Structures, Applied Mathematics, 7, 599 – 604, (2016).
• [4] Mahdieh Azari, Ali Iranmanesh, and Mircea V. Diudea, Vertex-Eccentricity Descriptors in Dendrimers, Studia Ubb Chemia., LXII(1), 129 – 142, (2017).
• [5] Surendra Tripathy, and Malay K Das, Dendrimers and their Applications as Novel Drug Delivery Carriers, Journal of Applied Pharmaceutical Science., 3 (09), 142 – 149, (2013).
• [6] https://en.wikipedia.org/wiki/Crystastructure.