On the Rainbow and Strong Rainbow Connection Numbers of the m-Splitting of the Complete Graph Kn

Fendy Septyanto, Kiki Ariyanti

Research output: Contribution to journalConference articlepeer-review

6 Citations (Scopus)

Abstract

An edge-coloring of a graph is called rainbow if any two vertices are connected by a path consisting of edges of different colors. The least number of colors in such a coloring is called the rainbow connection number of G, denoted by rc(G). An edge-coloring of a graph is called strong rainbow if any two vertices are connected by a geodesic consisting of edges of different colors. The least number of colors in such a coloring is called the strong rainbow connection number of G, denoted by src(G). In this paper we study the rc and src of the m-splitting of a graph. In particular we study Splm(Kn). We present the exact values of its rc and src in several cases, and we prove several bounds in the other cases.

Original languageEnglish
Pages (from-to)155-161
Number of pages7
JournalProcedia Computer Science
Volume74
DOIs
Publication statusPublished - 1 Jan 2015
Event2nd International Conference of Graph Theory and Information Security, 2015 - Bandung, Indonesia
Duration: 21 Sep 201523 Sep 2015

Keywords

  • complete graph
  • Edge coloring
  • m-splitting
  • rainbow connection

Fingerprint Dive into the research topics of 'On the Rainbow and Strong Rainbow Connection Numbers of the m-Splitting of the Complete Graph K<sub>n</sub>'. Together they form a unique fingerprint.

Cite this