Open Access
Antimagic labeling of the union of stars.
Dafik,Mirka Miller,Joe Ryan,Martin Bača +3 more
- Vol. 42, pp 35-44
TLDR
This paper considers super (a, d)edge-antimagic total labelings applied to the disjoint union of two stars K1,m and K2,n, a graph of order p and size q.Abstract:
Let G be a graph of order p and size q. An (a, d)-edge-antimagic total labeling of G is a one-to-one map f taking the vertices and edges onto 1, 2, . . . , p + q so that the edge-weights w(u, v) = f(u) + f(v) + f(uv), uv ∈ E(G), form an arithmetic progression, starting from a and having common difference d. Moreover, such a labeling is called super (a, d)edge-antimagic total if f(V (G)) = {1, 2, . . . , p}. This paper considers such labelings applied to a disjoint union of two stars K1,m and K1,n.read more
Citations
More filters
Journal ArticleDOI
Super (a,d)-edge antimagic total labeling of a subclass of trees
TL;DR: This paper investigates the super ( a , d ) -edge-antimagic total labeling of a subclass of trees called subdivided stars for all possible values of d, mainly d = 1, 3 .
Journal ArticleDOI
Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph
TL;DR: In this paper, the super (a, d ) -edge antimagic vertex labeling properties of connected Ferris Wheel F W m,n by using deductive axiomatic method were studied.
Pelabelan Total Super (a,d)-Sisi Antimagic pada Graf Shackle Fan Berorder 5
Arika Indah Kristiana,Dafik +1 more
Super (a,d)-edge Antimagic Total Labeling of\\ Shackle ($F_6, B_2, n$) for Developing a Polyalphabetic Cryptosystem
TL;DR: In this article, a super edge-antimagic total labeling of Shackle (F 6 ; B 2 ; n ) Graph connected was studied and used to develop a polyalphabetic cryptosystem.
Book ChapterDOI
Super (a, 3)-edge Antimagic Total Labeling for Union of Two Stars
M. Nalliah,Subramanian Arumugam +1 more
TL;DR: This paper investigates the existence of super (a, 3)-edge antimagic total labelings for union of two stars in the graph G, a super edge-magic graph.
References
More filters
Journal ArticleDOI
Magic valuations of finite graphs
Anton Kotzig,Alexander Rosa +1 more
TL;DR: In this article, the existence of magic valuations for complete graphs was investigated for graphs, which are related to cyclic decompositions of complete graphs into isomorphic subgraphs.
On magic graphs
S. M. Hegde,Sudhakar Shetty +1 more
TL;DR: The maximum of all constants say, M (G), analogous to m(G), is defined, and strong magic, ideal magic, weak magic labelings are introduced, and it is proved that some known classes of graphs admit such labelings.
Journal Article
On Super Edge-Magic Graphs.
Journal ArticleDOI
The place of super edge-magic labelings among other classes of labelings
TL;DR: It is proved that every super edge-magic ( p, q )-graph is harmonious and sequential (for a tree or q ⩾ p ) as well as it is cordial, and sometimes graceful.