Results 61 to 70 of about 920 (119)
On Super (a, d)‐Edge‐Antimagic Total Labeling of Special Types of Crown Graphs
Journal of Applied Mathematics, Volume 2013, Issue 1, 2013., 2013 For a graph G = (V, E), a bijection f from V(G) ∪ E(G) → {1, 2, …, |V(G)| + |E(G)|} is called (a, d)‐edge‐antimagic total ((a, d)‐EAT) labeling of G if the edge‐weights w(xy) = f(x) + f(y) + f(xy), xy ∈ E(G), form an arithmetic progression starting from a and having a common difference d, where a > 0 and d ≥ 0 are two fixed integers.
Himayat Ullah +4 more
wiley +1 more source
Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph
Jurnal Ilmu Dasar, 2015 Let G be a simple graph of order p and size q. Graph G is called an (a,d)-edge-antimagic totalifthereexistabijectionf :V(G)∪E(G)→{1,2,...,p+q}suchthattheedge-weights,w(uv)= f(u)+f(v)+f(uv); u, v ∈ V (G), uv ∈ E(G), form an arithmetic sequence with first ...
Djoni Budi Sumarno +2 more
doaj +1 more source
, 2013 For an arbitrary set of distances $D\subseteq \{0,1, \ldots, diam(G)\}$, a $D$-weight of a vertex $x$ in a graph $G$ under a vertex labeling $f:V\rightarrow \{1,2, \ldots , v\}$ is defined as $w_D(x)=\sum_{y\in N_D(x)} f(y)$, where $N_D(x) = \{y \in V| d(x,y) \in D\}$. A graph $G$ is said to be $D$-distance magic if all vertices has the same $D$-vertex-
Simanjuntak, Rinovia, Wijaya, Kristiana
openaire +2 more sources
On super --antimagic total labeling of disjoint union of cycles
AKCE International Journal of Graphs and Combinatorics, 2018 Let and be finite simple graphs where every edge of belongs to at least one subgraph that is isomorphic to . An --antimagic total labeling of a graph is a bijection such that for all subgraphs isomorphic to , the -weights, form an arithmetic progression ...
Faisal Susanto
doaj +2 more sources
On local distance antimagic labeling of graphs
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be a graph of order n and let [Formula: see text] be a bijection. For every vertex [Formula: see text], we define the weight of the vertex v as [Formula: see text] where N(v) is the open neighborhood of the vertex v. The bijection
Adarsh Kumar Handa +2 more
doaj +1 more source
Group-antimagic Labelings of Multi-cyclic Graphs
Theory and Applications of Graphs, 2016 Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagic} if there exists an edge labeling $f: E(G) \to A \backslash \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \Sigma$
Dan Roberts, Richard Low
doaj +1 more source
On local antimagic vertex coloring of corona products related to friendship and fan graph
Indonesian Journal of Combinatorics, 2021 Let G=(V,E) be connected graph. A bijection f : E → {1,2,3,..., |E|} is a local antimagic of G if any adjacent vertices u,v ∈ V satisfies w(u)≠ w(v), where w(u)=∑e∈E(u) f(e), E(u) is the set of edges incident to u. When vertex u is assigned the color w(u)
Zein Rasyid Himami, Denny Riama Silaban
doaj +1 more source
Local Antimagic Chromatic Number for Copies of Graphs
Mathematics, 2021 An edge labeling of a graph G=(V,E) using every label from the set {1,2,⋯,|E(G)|} exactly once is a local antimagic labeling if the vertex-weights are distinct for every pair of neighboring vertices, where a vertex-weight is the sum of labels of all ...
Martin Bača +2 more
doaj +1 more source
Approximate results for rainbow labelings [PDF]
, 2015 Article de ...
Lladó Sánchez, Ana M.
core +1 more source
On cordial labeling of hypertrees
, 2019 Let $f:V\rightarrow\mathbb{Z}_k$ be a vertex labeling of a hypergraph $H=(V,E)$. This labeling induces an~edge labeling of $H$ defined by $f(e)=\sum_{v\in e}f(v)$, where the sum is taken modulo $k$.
Tuczyński, Michał +2 more
core +1 more source