Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Local Antimagic Edge Coloring Of Gear Graphs And Semi Parachute Graphs
View through CrossRef
The graph G is a pair of sets consisting of a vertex set V(G) and an edge set E(G), denoted by G = (V (G),E(G)). Coloring a graph involves assigning colors to each vertex, edge, or region such that no adjacent vertices, edges, or regions share the same color. A bijective function f∶ V (G) → {1,2,3,...,|V (G)|} is called a local edge antimagic coloring if for any two adjacent edges e_1 and e_2, they have different weights, w(e_1) ≠ w(e_2), where e = uv ∈ E(G) and w(e) = f (u)+f (v). The chromatic number is the term used in the context of local antimagic coloring, referring to the minimum number of colors derived from local antimagic labeling. This research discusses the local antimagic edge coloring on the Gear Graph (G_n) and the Semi Parachute Graph (SP_(2n-1)). The aim of the research is to determine the chromatic number of local antimagic edge coloring χlea(G) for the researched graphs. The method used in this research is pattern detection to derive the general pattern. Based on the analysis, the chromatic number of local antimagic edge coloring is obtained for the Gear Graph (G_n) and the Semi Parachute Graph (SP_(2n-1)) are χlea (G_n)=n + 2 and χlea(SP_(2n-1) )=n+ 2.
Universitas Nahdlatul Ulama Sunan Giri Bojonegoro
Title: Local Antimagic Edge Coloring Of Gear Graphs And Semi Parachute Graphs
Description:
The graph G is a pair of sets consisting of a vertex set V(G) and an edge set E(G), denoted by G = (V (G),E(G)).
Coloring a graph involves assigning colors to each vertex, edge, or region such that no adjacent vertices, edges, or regions share the same color.
A bijective function f∶ V (G) → {1,2,3,.
,|V (G)|} is called a local edge antimagic coloring if for any two adjacent edges e_1 and e_2, they have different weights, w(e_1) ≠ w(e_2), where e = uv ∈ E(G) and w(e) = f (u)+f (v).
The chromatic number is the term used in the context of local antimagic coloring, referring to the minimum number of colors derived from local antimagic labeling.
This research discusses the local antimagic edge coloring on the Gear Graph (G_n) and the Semi Parachute Graph (SP_(2n-1)).
The aim of the research is to determine the chromatic number of local antimagic edge coloring χlea(G) for the researched graphs.
The method used in this research is pattern detection to derive the general pattern.
Based on the analysis, the chromatic number of local antimagic edge coloring is obtained for the Gear Graph (G_n) and the Semi Parachute Graph (SP_(2n-1)) are χlea (G_n)=n + 2 and χlea(SP_(2n-1) )=n+ 2.
Related Results
On Rainbow Antimagic Coloring of Joint Product of Graphs
On Rainbow Antimagic Coloring of Joint Product of Graphs
Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for ...
On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle
On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle
Let be a nontrivial and connected graph of vertex set and edge set . A bijection is called a local edge antimagic labeling if for any two adjacent edges and , where for . Thus...
On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree
On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree
Given a graph G with vertex set V(G) and edge set E(G), for the bijective function f(V(G))→{1,2,⋯,|V(G)|}, the associated weight of an edge xy∈E(G) under f is w(xy)=f(x)+f(y). If a...
On local edge antimagic chromatic number of graphs
On local edge antimagic chromatic number of graphs
Let G=(V,E) be a graph of order p and size q having no isolated vertices. A bijection f from V to {1,2,3,...,p} is called a local edge antimagic labeling if for any two adjacent ...
Local antimagic vertex coloring of unicyclic graphs
Local antimagic vertex coloring of unicyclic graphs
The local antimagic labeling on a graph G with |V| vertices and |E| edges is defined to be an assignment f : E --> {1, 2,..., |E|} so that the weights of any two adjacent ve...
Local vertex antimagic chromatic number of some wheel related graphs
Local vertex antimagic chromatic number of some wheel related graphs
Let G = (V,E) be a graph of order p and size q having no isolated vertices. A bijection ƒ : E → {1, 2, 3, ..., q} is called a local antimagic labeling if for all uv ∈ E we have w(u...
Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
Graph Coloring
Graph Coloring
In this chapter a particular type of graph labeling, called graph coloring, is introduced and discussed. In the first part, the simple type of coloring, vertex coloring, is focused...