The rainbow connection number of graph resulting for operation of sun graph and path graph

N. M. Surbakti, D. R. Silaban, K. A. Sugeng

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings of the 5th International Symposium on Current Progress in Mathematics and Sciences, ISCPMS 2019
EditorsTerry Mart, Djoko Triyono, Tribidasari Anggraningrum Ivandini
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735420014
DOIs
Publication statusPublished - 1 Jun 2020
Event5th International Symposium on Current Progress in Mathematics and Sciences, ISCPMS 2019 - Depok, Indonesia
Duration: 9 Jul 201910 Jul 2019

Publication series

NameAIP Conference Proceedings
Volume2242
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

Conference5th International Symposium on Current Progress in Mathematics and Sciences, ISCPMS 2019
Country/TerritoryIndonesia
CityDepok
Period9/07/1910/07/19

Keywords

  • join product
  • path graph
  • rainbow connection number
  • strong product
  • sun graph

Fingerprint

Dive into the research topics of 'The rainbow connection number of graph resulting for operation of sun graph and path graph'. Together they form a unique fingerprint.

Cite this