Enter your keyword

2-s2.0-84964089175

[vc_empty_space][vc_empty_space]

The Rainbow Connection Number of Origami Graphs and Pizza Graphs

Nabila S.a, Salman A.N.M.a

a Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Bandung, 40132, Indonesia

[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2015 The Authors.Let G = (V(G), E(G)) be a nontrivial, finite, and connected graph. Define a k-coloring c: E(G) → {1, 2,⋯, n} for some n ε N, where two adjacent edges may have the same color. A path from u to v, denoted by u – v path, is said a u – v rainbow path, if there are no two edges in u – v path having the same color. A k-coloring is said a rainbow k-coloring, if every pair of vertices u and v in the V(G) has a u – v rainbow path. The minimum k for which there exists such a k-coloring is defined as the rainbow connection number rc(G) of G. In this paper we introduce two new classes, namely origami graphs and pizza graphs. We determine the rainbow connection number of the graphs.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Connection number,Edge coloring,origami graph,pizza graph,Rainbow colorings[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Edge coloring,origami graph,pizza graph,rainbow coloring,rainbow connection number[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1016/j.procs.2015.12.093[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]