Results 111 to 120 of about 580,661 (153)
On Super Edge Local Antimagic Total Labeling by Using an Edge Antimagic Vertex Labeling Technique
, 2019 INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 07, JULY 2019In this paper, we consider that all graphs are finite, simple and connected. Let G(V,E) be a graph of vertex set V and edge set E.
Alfarisi, Ridho +4 more
core
Caterpillars have antimagic orientations
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
Lozano Bojados, Antoni
core
Local Antimagic r-dynamic Coloring of Graphs
, 2019 Let G = (V; E) be a connected graph. A bijection function f : E(G) ! f1; 2; 3; ; E(G)jg is called a local antimagic labeling if for all uv 2 E(G)s, w(u) 6= w(v), where w(u) = e2E(u)f(e).
KRISTIANA, Arika Indah +4 more
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Local Antimagic Vertex Coloring of a Graph
Graphs and Combinatorics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Subramanian Arumugam +2 more
exaly +2 more sources
Antimagic orientation of Halin graphs
Discrete Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaowei Yu, Yulin Chang, Shan Zhou
exaly +3 more sources
Face Antimagic Labeling of Jahangir Graph
Mathematics in Computer Science, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhammad Numan
exaly +3 more sources
, 2019 Magic and antimagic labelings are among the oldest labeling schemes in graph theory. This book takes readers on a journey through these labelings, from early beginnings with magic squares up to the latest results and beyond. Starting from the very basics, the book offers a detailed account of all magic and antimagic type labelings of undirected graphs.
Baca, Martin +3 more
openaire +2 more sources
Antimagic labeling and canonical decomposition of graphs
Information Processing Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael D Barrus
exaly +2 more sources
Graph antimagic labeling: A survey
Discrete Mathematics, Algorithms and Applications, 2023An antimagic labeling of a simple graph [Formula: see text] is a bijection [Formula: see text] such that [Formula: see text] for any two vertices [Formula: see text] in [Formula: see text]. We survey the results about antimagic labelings and other labelings motivated by antimagic labelings of graphs, and present some conjectures and open questions.
Jingxiang Jin, Zhuojie Tu
openaire +3 more sources
Perfectly antimagic total graphs
Journal of Intelligent & Fuzzy Systems, 2023An one-one correspondence function λ from V(G) ∪ E(G) to the set {1, 2, …, |V(G) | + |E(G) |} is a total labeling of a finite undirected graph G without loops and multiple edges, where |V(G) |and |E(G) | are the cardinality of vertex and edge set of G respectively.
P. Swathi +3 more
openaire +1 more source