Results 11 to 20 of about 201,420 (145)
On (a,1)-Vertex-Antimagic Edge Labeling of Regular Graphs [PDF]
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 +3 more sources
Antimagic Labeling of Some Degree Splitting Graphs [PDF]
Ratio Mathematica, 2023 A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct. As Wang et al.
Chirag Barasara, Palak Prajapati
doaj +2 more sources
Antimagic Labeling of Forests [PDF]
The PUMP Journal of Undergraduate Research, 2023 An antimagic labeling of a graph G(V,E) is a bijection f mapping from E to the set {1,2,…, |E|}, so that for any two different vertices u and v, the sum of f(e) over all edges e incident to u, and the sum of f(e) over all edges e incident to v, are distinct. We call G antimagic if it admits an antimagic labeling.
Sierra, J., Liu, D. D.-F., Toy, J.
core +5 more sources
On local antimagic total labeling of complete graphs amalgamation [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a connected simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling.
Gee-Choon Lau, Wai Chee Shiu
doaj +3 more sources
ANTIMAGIC LABELING OF DIGRAPHS [PDF]
Journal of the Indonesian Mathematical Society, 2016 AbstractAn antimagic labeling of a digraph D with p vertices and q arcs is a bin f from the set of all arcs to the set of positive integers such that all the p oriented vertex weights are distinct, where an oriented vertex weight is the sum of the labels of all arcs entering that vertex minus the sum of the labels of all arcs leaving it. A digraph
Nalliah Moviri
openaire +4 more sources
Antimagic Labeling of Regular Graphs [PDF]
Journal of Graph Theory, 2015 A graph $G=(V,E)$ is antimagic if there is a one-to-one correspondence $f: E \to \{1,2,\ldots, |E|\}$ such that for any two vertices $u,v$, $\sum_{e \in E(u)}f(e) \ne \sum_{e\in E(v)}f(e)$. It is known that bipartite regular graphs are antimagic and non-bipartite regular graphs of odd degree at least three are antimagic.
Feihuang Chang +3 more
core +6 more sources
Super H-Antimagic Total Covering for Generalized Antiprism and Toroidal Octagonal Map
Journal of Mathematics, 2021 Let G be a graph and H⊆G be subgraph of G. The graph G is said to be a,d-H antimagic total graph if there exists a bijective function f:VH∪EH⟶1,2,3,…,VH+EH such that, for all subgraphs isomorphic to H, the total H weights WH=WH=∑x∈VHfx+∑y∈EHfy forms an ...
Amir Taimur +4 more
doaj +2 more sources
Antimagic Labeling of Extension of Double Star [PDF]
Pandian Journal of Mathematical Sciences, 2022 An antimagic labeling of a simple, finite connected graph with p vertices and q edges is a bijection from the set of edges to the set of integers {1, 2, …, q} such that the vertex sums are pairwise distinct where the vertex sum at one vertex is the sum ...
Dr C. Meenakshi
doaj +2 more sources
Enumeration of the Edge Weights of Symmetrically Designed Graphs
Journal of Mathematics, 2021 The idea of super a,0-edge-antimagic labeling of graphs had been introduced by Enomoto et al. in the late nineties. This article addresses super a,0-edge-antimagic labeling of a biparametric family of pancyclic graphs.
Muhammad Javaid +2 more
doaj +2 more sources
Super -edge antimagic total labeling of a subclass of trees [PDF]
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 +2 more sources