@inproceedings{665a59f9bd8d41fa941d1fd84826bd14,

title = "Rainbow connection and strong rainbow connection of the crystal graph and neurons graph",

abstract = "A rainbow path in a graph G is an edge colored graph such that each edge in the path does not have the same color. The minimal number of colors which is needed to color the edges in the path so that every pair of vertices is connected by at least one rainbow path is called the rainbow connection number of G, denoted by rc(G). A rainbow path of length d(u, v), where d(u, v) is the distance between u and v, is called rainbow u - v geodesic in G. A strongly rainbow connected graph is a graph such that there exists a rainbow u-v geodesic for any two vertices u and v in G. The strong rainbow connection number src(G) of G is the minimum number of colors needed to make G strongly rainbow connected graph. In this paper, we prove the exact values of rc and src for crystal graph and its generalization to neuron graph.",

keywords = "Crystal graph, neuron graph, rainbow connection, rainbow path, strong rainbow connection",

author = "H. Lubis and Surbakti, {N. M.} and Kasih, {R. I.} and Silaban, {D. R.} and Sugeng, {K. A.}",

note = "Publisher Copyright: {\textcopyright} 2019 Author(s).; 4th International Symposium on Current Progress in Mathematics and Sciences 2018, ISCPMS 2018 ; Conference date: 30-10-2018 Through 31-10-2018",

year = "2019",

month = nov,

day = "4",

doi = "10.1063/1.5132480",

language = "English",

series = "AIP Conference Proceedings",

publisher = "American Institute of Physics Inc.",

editor = "Terry Mart and Djoko Triyono and Anggraningrum, {Ivandini T.}",

booktitle = "Proceedings of the 4th International Symposium on Current Progress in Mathematics and Sciences, ISCPMS 2018",

}