Results 11 to 20 of about 909,592 (58)
D-Antimagic Labelings of Oriented Star Forests [PDF]
For a distance set $D$, an oriented graph $\overrightarrow{G}$ is $D$-antimagic if there exists a bijective vertex labeling such that the sum of all labels of $D$-out-neighbors is distinct for each vertex.
Simanjuntak, Rinovia +1 more
core +7 more sources
Every connected graph admits a local antimagic orientation and almost every graph admits an antimagic orientation [PDF]
An undirected graph $G$ is said to admit an antimagic orientation if there exist an orientation $D$ and a bijection between $E(G)$ and $\{1,2,\ldots,|E(G)|\}$ such that any two vertices have distinct vertex sums, where the vertex sum of a vertex is the ...
Dhananjaya, Eranda, Li, Wei-Tian
core +5 more sources
D-Antimagic Labelings on Oriented Linear Forests [PDF]
Let $\overrightarrow{G}$ be an oriented graph with the vertex set $V(\overrightarrow{G})$ and the arc set $A(\overrightarrow{G})$. Suppose that $D\subseteq \{0,1,\dots,\partial \}$ is a distance set where $\partial=\max \{d(u,v)
Simanjuntak, Rinovia +1 more
core +7 more sources
D-Antimagic Labelings of Oriented 2-Regular Graphs [PDF]
Given an oriented graph $\overrightarrow{G}$ and $D$ a distance set of $\overrightarrow{G}$, $\overrightarrow{G}$ is $D$-antimagic if there exists a bijective vertex labeling such that the sum of all labels of the $D$-out-neighbors of each vertex is ...
Simanjuntak, Rinovia +1 more
core +3 more sources
On k-shifted antimagic spider forests [PDF]
, 2021 Let G(V,E) be a simple graph with m edges. For a given integer k, a k-shifted antimagic labeling is a bijection f:E(G)→{k+1,k+2,…,k+m} such that all vertices have different vertex-sums, where the vertex-sum of a vertex v is the total of the labels ...
Fei-Huang Chang, Wei-Tian Li, Daphne Der-Fen Liu, Zhishi Pan
core +2 more sources
The antimagic orientation problems for graphs obtained by some graph operations [PDF]
, 2022 A simple graph $G$ is said to admit an antimagic orientation if there exist an orientation on the edges of $G$ and a bijection from $E(G)$ to $\{1,2,\ldots,|E(G)|\}$ such that the vertex sums of vertices are pairwise distinct, where the vertex sum of a ...
Dhananjaya, Eranda, Li, Wei-Tian
core +1 more source
Antimagic Orientation of Biregular Bipartite Graphs
The Electronic Journal of Combinatorics, 2017 An antimagic labeling of a directed graph $D$ with $n$ vertices and $m$ arcs is a bijection from the set of arcs of $D$ to the integers $\{1, \cdots, m\}$ such that all $n$ oriented vertex sums are pairwise distinct, where an oriented vertex sum is the sum of labels of all arcs entering that vertex minus the sum of labels of all arcs leaving it.
Songling Shan, Xiaowei Yu
openaire +4 more sources
Antimagic Labeling of Some Biregular Bipartite Graphs [PDF]
, 2022 An antimagic labeling of a graph G = (V, E) is a one-to-one mapping from E to {1, 2, . . ., |E|} such that distinct vertices receive different label sums from the edges incident to them. G is called antimagic if it admits an antimagic labeling.
Deng, Kecai, Li, Yunfei
core +1 more source
, 2007 For a graph G = (V ,E), a bijection g from V (G) ∪ E(G) into {1, 2, . . . , |V (G)| + |E(G)|} is called (a, d)-edge-antimagic total labeling of G if the edge-weights w(xy) = g(x) + g(y) + g(xy), xy belong to E(G), form an arithmetic progression starting ...
M. Miller, M. Baca
core +3 more sources
Shifted-Antimagic Labelings for Graphs [PDF]
, 2021 The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic.
Pan, Zhi-shi
core +1 more source