Results 91 to 100 of about 412,708 (144)
On the RACN of the comb product of the cycle C_3 with path P_n and broom Br_(n,m)
Journal Focus Action of Research MathematicThe combination of rainbow coloring and anti-magic labeling is known as Rainbow Antimagic Coloring (RAC). The Rainbow Antimagic Connection Number (RACN) of a graph G is the smallest number of colors induced by all edge weights under an antimagic labeling,
Brian Juned Septory +2 more
doaj +1 more source
Totally antimagic total graphs
For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, ..., |V(G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge ...
Anita Abildgaard Sillasen (21325523) +5 more
core
The concept of labeling of graphs has attracted many researchers to this branch of research since the concept was introduced. It is becoming popular, partly because of mathematical challenges, and partly also because of the wide range of applications in ...
Oudone Phanalasy (21269891)
core
On Local Antimagic Chromatic Number of Graphs with Cut-vertices [PDF]
An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f: E → {1, …, |E|} such that for any pair of adjacent vertices x and y, f+ (x) ≠ f+ (y), where the induced vertex label f+ (x) =∑ f(e), with e ranging ...
Lau, Gee Choon +2 more
core +1 more source
On bridge graphs with local antimagic chromatic number 3
, 2023 Let $G=(V, E)$ be a connected graph. A bijection $f: E\to \{1, \ldots, |E|\}$ is called a local antimagic labeling if for any two adjacent vertices $x$ and $y$, $f^+(x)\neq f^+(y)$, where $f^+(x)=\sum_{e\in E(x)}f(e)$ and $E(x)$ is the set of edges ...
Lau, G. C., Shiu, W. C., Zhang, R. X.
core
Antimagic Labeling for Some Snake Graphs
Proyecciones (Antofagasta)A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. In this paper we study antimagic labeling of double triangular snake, alternate triangular snake, double alternate triangular snake, quadrilateral snake, double ...
Chirag Barasara, Palak Prajapati
openaire +1 more source
Antimagic Labeling of Graphs Using Prime Numbers [PDF]
Graph labeling is a technique that assigns unique labels or weights to the vertices or edges of a graph, often used to analyze and solve various graph-related problems. There are few methods with certain limitations conducted by researchers previously on
Habib, Md. Imtiaz, Islam, Arafat
core +1 more source
A note on local edge antimagic chromatic number of graphs
Let $G$ be a finite, undirected and simple graph. A bijection $f : V(G) \to [1,|V(G)|]$ is called a local edge antimagic labeling if for any two adjacent edges $uv,vw \in E(G), f(u) \ne f(w)$.
Maryati, Tita Khalis +1 more
core +1 more source
Local Distance Antimagic Vertex Coloring of Graphs
A bijective function $f:V\rightarrow\left\{1,2,3,...,|V| \right\}$ is said to be a local distance antimagic labeling of a graph $G=(V,E)$, if $w(u)\neq w(v)$ for any two adjacent vertices $u, v$ where the weight $w(v)=\sum_{z\in N(v)}f(z)$.
S, Devi Yamini, T, Divya
core +1 more source
On local distance antimagic chromatic number of graphs disjoint union with 1-regular graphs
Let $G$ be a graph on $p$ vertices and $q$ edges with no isolated vertices. A bijection $f: V\rightarrow \{1,2,3,...,p\}$ is called local distance antimagic labeling, if for any two adjacent vertices $u$ and $v$, we have $w(u) \neq w(v)$, where $w(u ...
Nalliah, M., M, Nalliah
core +1 more source