Journal ArticleOPEN ACCESS

Rainbow Connection Number on Amalgamation of General Prism Graph

  • Yandera R
  • Irene Y
  • Aribowo W
InPrime: Indonesian Journal of Pure and Applied Mathematics (2019) 1(1)
DOI: 10.15408/inprime.v1i1.12732
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

AbstractLet  be a nontrivial connected graph, the rainbow-k-coloring of graph G is the mapping of c: E(G)-> {1,2,3,…,k} such that any two vertices from the graph can be connected by a rainbow path (the path with all edges of different colors). The least natural number

Cite

CITATION STYLE

APA

Yandera, R. H., Irene, Y., & Aribowo, W. (2019). Rainbow Connection Number on Amalgamation of General Prism Graph. InPrime: Indonesian Journal of Pure and Applied Mathematics, 1(1). https://doi.org/10.15408/inprime.v1i1.12732

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free