@inproceedings{26a5772df67b4ebdb6c05e52c8cf818f,

title = "The rainbow connection number of graph resulting for operation of sun graph and path graph",

abstract = "Let G is a connected graph. A rainbow k-coloring on G is a function c: E(G) → {1, ⋯, k} for k ϵ ℕ where for any two vertices u and v in V, there is a path which all edges have no same color. A path that all edges have no the same color is called a rainbow path. Let k is the smallest positive integer that is needed to make G be rainbow connected, then k is called by the rainbow connection number of G symbolized by rc(G). There are many researches on rainbow connection number of operation graph classes that have been done. In this paper, we use join product and strong product as operations on sun graph cn⊙{\=k}1 and path graph Pm for determining the rainbow connection number.",

keywords = "join product, path graph, rainbow connection number, strong product, sun graph",

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

note = "Funding Information: Part of this research is funded by Universitas Indonesia through Hibah PITTA B UI under contract No. NKB-0622/UN2.R3.1/HKP.05.00/2019. Publisher Copyright: {\textcopyright} 2020 Author(s).; 5th International Symposium on Current Progress in Mathematics and Sciences, ISCPMS 2019 ; Conference date: 09-07-2019 Through 10-07-2019",

year = "2020",

month = jun,

day = "1",

doi = "10.1063/5.0007807",

language = "English",

series = "AIP Conference Proceedings",

publisher = "American Institute of Physics Inc.",

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

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

}