[vc_empty_space][vc_empty_space]
Further results on cycle-supermagic labeling
Roswitha M.a, Baskoro E.T.b, Maryati T.K.c, Kurdhi N.A.a, Susanti I.a
a Sebelas Maret University, Indonesia
b Combinatorial Mathematics Research Group, Institut Teknologi Bandung, Indonesia
c Mathematics Education, Universitas Islam Negeri Syarif Hidayatullah, 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]For a graph G(V, E), an edge-covering of G is a family of distinct subgraphs H1,… Hk such that any edge of E belongs to at least one of the subgraphs Hi, 1 ≤ i ≤ k. If every Hi is isomorphic to a given graph H, then G admits an H-covering. Graph G is said to be H-magic if G has an H-covering and there is a total labeling f : V ∪ E → {1, 2,…, {pipe}V{pipe}+{pipe}E{pipe}} such that for each subgraph H′ = (V′, E′) of G isomorphic to H, (Formula presented.) is a fixed constant. Furthermore, if f(V) = {1, 2,…, {pipe}V{pipe}} then G is called H-supermagic. The sum of all vertex and edge labels on H, under a labeling f, is denoted by Σf(H). In this paper we study H-supermagic labeling for some classes of graphs such as a Jahangir graph, a wheel graph for even n, and a complete bipartie graph Km,n for m = 2.[/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][/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]Complete bipartite graph,H-supermagic labeling,Jahangir graph,Wheel graph[/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][/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]