Results 11 to 20 of about 19,166,067 (60)
Local antimagic chromatic number of partite graphs [PDF]
, 2023 Let $G$ be a connected graph with $|V| = n$ and $|E| = m$. A bijection $f:E\rightarrow \{1,2,...,m\}$ is called a local antimagic labeling of $G$ if for any two adjacent vertices $u$ and $v$, $w(u) \neq w(v)$, where $w(u) = \sum_{e \in E(u)}f(e)$, and $E(
Pavithra, C. R. +2 more
core +1 more source
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs [PDF]
, 2021 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 ...
Ng, Ho-Kuen +8 more
core +2 more sources
On local edge antimagic chromatic number of graphs
, 2022 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 edges e=uv and e'=vw of G, we have w(e) is not equal to w (e'), where the ...
Nalliah, M., Rajkumar, S., M, Nalliah
core +1 more source
Local vertex antimagic chromatic number of some wheel related graphs
, 2022 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) ≠ w(v), the weight w(u) = ∑e∈E(u) f(e) where E(u) is the set of edges ...
Nalliah, M., M, Nalliah, Shankar, R.
core +1 more source
An algorithmic approach in constructing infinitely many even size graphs with local antimagic chromatic number 3 [PDF]
, 2023 An edge labeling of a connected 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 adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label $f^+(x)= \sum f(
Lau, Gee-Choon
core +1 more source
Complete characterization of s-bridge graphs with local antimagic chromatic number 2 [PDF]
, 2022 An edge labeling of a connected 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 adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label $f^+(x)= \sum f(
Nalliah, M. +4 more
core +1 more source
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 local antimagic total chromatic number of certain one point union of graphs [PDF]
Let $G = (V,E)$ be a connected simple graph of order $p$ and size $q$. A bijection $f:V(G)\cup E(G)\to \{1,2,\ldots,p+q\}$ is called a local antimagic total labeling of $G$ if for any two adjacent vertices $u$ and $v$, we have $w(u)\ne w(v)$, where $w(u)
Lau, Gee-Choon
core +1 more source
The fractional chromatic number of triangle-free subcubic graphs [PDF]
, 2014 Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14 / 5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free ...
Král’, Daniel +5 more
core +1 more source
On local antimagic chromatic number of spider graphs
, 2022 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