Results 41 to 50 of about 1,609,249 (128)
Caterpillars Have Antimagic Orientations
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018 An antimagic labeling of a directed graph D with m arcs is a bijection from the set of arcs of D to {1, …, m} such that all oriented vertex sums of vertices in D are pairwise distinct, where the oriented vertex sum of a vertex u is the sum of labels of ...
Lozano Antoni
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
New Results of Face Labeling for Some Plane Graphs
IEEE Access, 2019 A labeling of a plane graph is called super d-antimagic if the vertices receive the smallest labels and the weight set of all faces in an arithematic progression with difference d, where weight of each face is the some of all labels correspond to that ...
Nabila Hameed +4 more
doaj +1 more source
A network communication through McGee graph and Antimagic labeling
Malaya Journal of Matematik, 2021 Let G be a simple graph with p nodes and q links. A one to one correspondence between the set of links and the set of integers { 1 , 2 ,..., q } is called the Antimagic labeling if the sum of the link labels incident with a node is different for all ...
D. Sathiya +3 more
semanticscholar +1 more source
On (a,1)-Vertex-Antimagic Edge Labeling of Regular Graphs
Journal of Applied Mathematics, 2015 An (a,s)-vertex-antimagic edge labeling (or an (a,s)-VAE labeling, for short) of G is a bijective mapping from the edge set E(G) of a graph G to the set of integers 1,2,…,|E(G)| with the property that the vertex-weights form an arithmetic sequence ...
Martin Bača +3 more
doaj +1 more source
Distance antimagic labeling of join and corona of two graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices .
A.K. Handa +3 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 the Integer-antimagic Spectra of Non-Hamiltonian Graphs
Theory and Applications of Graphs, 2022 Let $A$ be a nontrivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagic} if there exists an edge labeling $f: E(G) \to A \setminus \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \Sigma$ $
Wai Shiu, Richard Low
doaj +1 more source
On the local antimagic labeling of graphs amalgamation
, 2021 Let G be a simple connected graph, an ordered pair of sets G(V, E), with V is a set of vertices and E is a set of edges. Graph coloring has been one of the most popular branches in topics of graph theory. In 2017 Arumugam et al. developed a new notion of
E. Y. Kurniawati +3 more
semanticscholar +1 more source
Some results on (a,d)-distance antimagic labeling
Proyecciones (Antofagasta), 2020 Let G = (V,E) be a graph of order N and f : V → {1, 2,...,N} be a bijection. For every vertex v of graph G, we define its weight w(v) as the sum ∑u∈N(v) f(u), where N(v) denotes the open neighborhood of v. If the set of all vertex weights forms an arithmetic progression {a, a + d, a + 2d, . . .
S. K. Patel, Jayesh Vasava
openaire +3 more sources