Packing Chromatic Number of Bismuth Tri-iodide and First Type Nanostar Dendrimers

Yayın Aralığı: Yılda 4 Sayı
Başlangıç: 1988
Yayıncı: Gazi Üniversitesi, Fen Bilimleri Enstitüsü

The packing chromatic number ( ) Gof a connected graphGis the smallest numbermforwhich a functiong V G m : ( ) {1,2,..., } exists, such that ifg a g b j ( ) ( ) ,  thend a b j ( , )  .Here, we determine the packing chromatic numbers of bismuth tri-iodide and first type nanostardendrimers.

PDF

___

Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T., Harris, J. M., Rall, D.F., “Broadcast Chromatic Numbers of Graphs”, Ars Combin , 86: 33–49, (2008).
Bre?̌ar, B., Klav?̌ar, S., Rall, D.F., “On the packing chromatic number of cartesian products, hexagonal lattice and trees”, Discrete Appl. Math., 155 (17): 2303–2311, (2007).
Azari, M., Iranmanesh, M., Diudea, M.V., “Vertex-eccentricity descriptors in dendrimers”, Studia Univ. Babes Bolyai Chem., 62(1): 129–142, (2017).
Tripathy, S., Das, M.K., “Dendrimers and their applications as novel drug delivery carriers”, Journal of Applied Pharmaceutical Science., 3(09): 142–149, (2013).
https://en.wikipedia.org/wiki/Crystal_structure.
Krishnan, S., and Rajan, B., “Fault-tolerant resolvability of certain crystal structures”, Applied Mathematics, 7: 599–604, (2016).