Results 31 to 40 of about 1,609,249 (128)
Antimagic Labeling for Product of Regular Graphs
Symmetry, 2022 An antimagic labeling of a graph G=(V,E) is a bijection from the set of edges of G to 1,2,⋯,E(G) and such that any two vertices of G have distinct vertex sums where the vertex sum of a vertex v in V(G) is nothing but the sum of all the incident edge ...
Vinothkumar Latchoumanane +1 more
semanticscholar +1 more source
On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2019 Let be a nontrivial and connected graph of vertex set and edge set . A bijection is called a local edge antimagic labeling if for any two adjacent edges and , where for . Thus, the local edge antimagic labeling induces a proper edge coloring of G if
Siti Aisyah +4 more
doaj +1 more source
On super --antimagic total labeling of disjoint union of cycles
AKCE International Journal of Graphs and Combinatorics, 2018 Let and be finite simple graphs where every edge of belongs to at least one subgraph that is isomorphic to . An --antimagic total labeling of a graph is a bijection such that for all subgraphs isomorphic to , the -weights, form an arithmetic progression ...
Faisal Susanto
doaj +2 more sources
Face Antimagic Labeling for Double Duplication of Barycentric and Middle Graphs
Iraqi Journal of Science, 2022 This paper proves the existence of face antimagic labeling for double duplication of barycentric subdivision of cycle and some other graphs
Vasuki B, S. L., M. A. Ahmed
semanticscholar +1 more source
Super -edge antimagic total labeling of a subclass of trees
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 +1 more source
Antimagicness for a family of generalized antiprism graphs
Electronic Journal of Graph Theory and Applications, 2014 An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of integers $\{1,2,\dots, |E|\}$ such that all vertex weights are pairwise distinct, where the weight of a vertex is the sum of all edge labels incident with ...
Dominique Buset +3 more
doaj +1 more source
On (a,d)-antimagic labelings of Hn, FLn and mCn
Indonesian Journal of Combinatorics, 2020 In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic.
Ramalakshmi Rajendran, K. M. Kathiresan
doaj +1 more source
A note on incomplete regular tournaments with handicap two of order n≡8(mod 16) [PDF]
Opuscula Mathematica, 2017 A \(d\)-handicap distance antimagic labeling of a graph \(G=(V,E)\) with \(n\) vertices is a bijection \(f:V\to \{1,2,\ldots ,n\}\) with the property that \(f(x_i)=i\) and the sequence of weights \(w(x_1),w(x_2),\ldots,w(x_n)\) (where \(w(x_i)=\sum_{x_i
Dalibor Froncek
doaj +1 more source
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 +1 more source
Integer-antimagic spectra of disjoint unions of cycles
Theory and Applications of Graphs, 2018 Let $A$ be a non-trivial abelian group. A simple graph $G = (V, E)$ is $A$-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) = \sum_{uv\in E(G)}f(uv ...
Wai Chee Shiu
doaj +1 more source