On rainbow connection and strong rainbow connection number of amalgamation of prism graph P3,2
Year: 2018
Type: conference-paper
Abstract: Let G be a nontrivial connected graph. We follow Chartrand, et al in [2] for the definiton of rainbow connection and strong rainbow connection number. For t ∊ N and t > 2, let { P (3,2) i | i ∊ {1, 2, ..., t }} is a finite collection of prism graph P 3,2 that has a fixed vertex v called a terminal. The amalgamation of prism graph, Amal ( P (3,2) i , v ), is a graph formed by taking all the element of finite collection of prism graph P 3,2 and identifying their terminal. This paper determines the rainbow connection and strong rainbow connection number from amalgamation of prism graph by a deductive reasoning method. The result are as follows: rc ( Amal ( P (3,2) i , v )) = 4 and src ( Amal ( P (3,2) i , v )) = max {4, t } for i ∊ {1, 2, ..., t }.
Authors: C.D.R. Palupi, W. Aribowo, Y. Irene, I. Hasanah
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2801412742