Results 71 to 80 of about 580,661 (153)
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 +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
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
A generalization of magic and antimagic labelings of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2019 A k-magic labeling of a finite, simple graph with and is a bijection from the set of edges into the integers such that the vertex set can be partitioned into sets and each vertex in the set has the same vertex sum and any two distinct vertices in different sets have different vertex sum, where a vertex sum is the sum of the labels of all edges incident
C. Meenakshi, KM. Kathiresan
openaire +3 more sources
Super -edge antimagic total labeling of a subclass of trees
AKCE International Journal of Graphs and Combinatorics, 2017 A graph labeling is a mapping that assigns numbers to graph elements. The domain can be the set of all vertices, the set of all edges or the set of all vertices and edges.
M. Javaid, A.A. Bhatti, M.K. Aslam
doaj +1 more source
On k-shifted antimagic spider forests
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 +1 more source
Antimagic Labelings of Caterpillars [PDF]
, 2019 A $k$-antimagic labeling of a graph $G$ is an injection from $E(G)$ to $\{1,2,\dots,|E(G)|+k\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $u$ is the sum of the labels assigned to edges incident to $u$.
Seara Ojea, Carlos +6 more
core +1 more source
Journal of MathematicsThe antimagic labeling of a graph is an important factor of graph theory, which implies the assignment of individual integer values to the graph’s vertices such that all the vertex sums remain unique. Due to the distinctive feature of antimagic labeling,
Poovarasi P, Kavitha K
doaj +1 more source
Distance Antimagic Labeling for Copies of Graph
Let G be a graph with vertex set V(G) and edge set E(G). Let f be a bijective function from the vertex set V(G) to the set {1,2,3,... ,|V(G)|} and weight of vertex v in V(G) is the sum of labels of all neighbors of vertex v.
Peter John +2 more
core +1 more source
SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED LAMPION GRAPH [PDF]
, 2015 . A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a bijection f: V(G)E(G) {1,2,…,p+q} such that the edge-weights, w(uv)=f(u)+f(v)+f(uv), uv E(G), form an arithmetic sequence with first term a and common ...
Slamin, S, Dafik, D, Adawiyah, Robiatul
core +1 more source