Local antimagic total chromatic number

Results 31 to 40 of about 19,166,067 (60)

Proof of a local antimagic conjecture [PDF]

, 2018
An antimagic labelling of a graph G is a bijection f : E ( G ) →{ 1 , . . . , | E ( G ) |} such that the sums S v = ∑ e 3 v f ( e ) distinguish all vertices v.
John Haslegrave, Haslegrave, John
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

Some Results on Local Distance Antimagic Chromatic Number of Graphs

Let G=(V,E) be a graph of order n without isolated vertices. A bijection f:V -- {1,2,...n} is called a local distance antimagic labeling if the weights of any two adjacent vertices are not equal, where the weight of a vertex is defined to be the sum of ...
Singh, Tarkeshwar, Almeida, Maurice Genevieva +1 more
core

On Super Edge Local Antimagic Total Labeling by Using an Edge Antimagic Vertex Labeling Technique

, 2019
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 07, JULY 2019In this paper, we consider that all graphs are finite, simple and connected. Let G(V,E) be a graph of vertex set V and edge set E.
Alfarisi, Ridho +4 more
core

Local antimagic vertex coloring of unicyclic graphs

, 2018
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 vertices u and v are distinct, that is, w(u)̸ ̸= w(v) where w(u) = Σe∈E(u) f(e)
D Dafik, Nuris Hisan Nazula, S Slamin
core +1 more source

Super local edge antimagic total coloring of Pn . H

, 2018
IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)In this paper, we consider that all graphs are ¯nite, simple and connected. Let G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡!
Alfarisi, Ridho +3 more
core

Antimagic labeling of regular graphs

, 2016
A graph G = (V, E ) is antimagic if there is a one-to-one correspondence f : E → {1, 2,..., |E|} such that for any two vertices u, v, Σe∈ E(u) f(e)≠Σe∈E(v ) f(e).
Feihuang Chang; Yu-Chang Liang; Zhishi Pan; Xuding Zhu
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 antimagic chromatic number of three disjoint cycles

An edge labeling of a graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f:E \to\{1,\ldots ,|E|\}$ such that for any pair of ...
Wai Chee Shiu, Gee-Choon Lau, Tsz Lung Chan +2 more
core +1 more source

New Families of tripartite graphs with local antimagic chromatic number 3 [PDF]

For a graph $G(V,E)$ of size $q$, a bijection $f : E(G) \to [1,q]$ is a local antimagc labeling if it induces a vertex labeling $f^+ : V(G) \to \mathbb{N}$ such that $f^+(u) \ne f^+(v)$, where $f^+(u)$ is the sum of all the incident edge label(s) of $u$,
Lau, Gee-Choon, Shiu, Wai Chee
core +1 more source