Super Edge Antimagic Total Labeling On Disjoint Union Of Cycle With Chord
نویسندگان
چکیده
منابع مشابه
Super edge-antimagic labeling of a cycle with a chord
An (a, d)-edge-antimagic total labeling of G is a one-to-one mapping g taking the vertices and edges onto 1, 2, . . . , |V (G)| + |E(G)| so that the edgeweights w(uv) = g(u) + g(v) + g(uv), uv ∈ E(G), form an arithmetic progression with initial term a and common difference d. Such a labeling is called super if the smallest labels appear on the vertices. In this paper, we investigate the existen...
متن کاملOn super edge-antimagic total labeling of subdivided stars
In 1980, Enomoto et al. proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In this paper, we give a partial support for the correctness of this conjecture by formulating some super (a, d)edge-antimagic total labelings on a subclass of subdivided stars denoted by T (n, n + 1, 2n + 1, 4n + 2, n5, n6, . . . , nr) for different values of the edgeantimagic labeling...
متن کاملOn super d-antimagic labelings of disjoint union of prisms
We label the vertices, edges and faces by the consecutive integers from 1 to |V |+ |E|+ |F | in such a way that the label of a face and the labels of the vertices and edges surrounding that face all together add up to a weight of that face. These face weights then form an arithmetic progression with common difference d. In this paper we examine the existence of such labeling for a disjoint unio...
متن کاملOn super vertex-antimagic total labelings of disjoint union of paths
Let G = (V,E) be a (p, q)-graph of order p and size q and f be a bijection from the set V ∪ E to the set of the first p + q natural numbers. The weight of a vertex is the sum of its label and the labels of all adjacent edges. We say f is an (a, d)-vertex-antimagic total labeling if the vertex-weights form an arithmetic progression with the initial term a and the common difference d. Such a labe...
متن کاملOn super (a, d)-edge antimagic total labeling of certain families of graphs
A (p, q)-graph G is (a, d)-edge antimagic total if there exists a bijection f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge weights Λ(uv) = f(u) + f(uv) + f(v), uv ∈ E(G) form an arithmetic progression with first term a and common difference d. It is said to be a super (a, d)-edge antimagic total if the vertex labels are {1, 2, . . . , p} and the edge labels are {p+ 1, p+ 2, . . . ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Ilmiah Soulmath : Jurnal Edukasi Pendidikan Matematika
سال: 2017
ISSN: 2581-1290,2337-9421
DOI: 10.25139/sm.v5i2.750