Results 21 to 30 of about 201,420 (145)
Journal of Mathematics, 2021 An edge labeling of graph G with labels in A is an injection from EG to A, where EG is the edge set of G, and A is a subset of ℝ. A graph G is called ℝ-antimagic if for each subset A of ℝ with A=EG, there is an edge labeling with labels in A such that ...
Yi-Wu Chang, Shan-Pang Liu
doaj +2 more sources
On H-Supermagic Labelings of m-Shadow of Paths and Cycles
International Journal of Mathematics and Mathematical Sciences, 2019 A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgraph isomorphic to H. A bijection f:V∪E→{1,2,3,…,V+E} is an (a,d)-H-antimagic total labeling of G if, for all subgraphs H′ isomorphic to H, the sum of ...
Ika Hesti Agustin +5 more
doaj +2 more sources
Some results on (a,d)-distance antimagic labeling
Proyecciones (Antofagasta), 2020 Let G = (V,E) be a graph of order N and f : V → {1, 2,...,N} be a bijection. For every vertex v of graph G, we define its weight w(v) as the sum ∑u∈N(v) f(u), where N(v) denotes the open neighborhood of v. If the set of all vertex weights forms an arithmetic progression {a, a + d, a + 2d, . . .
S. K. Patel, Jayesh Vasava
openaire +4 more sources
Super (a,d)-P_2⨀P_m-Antimagic Total Labeling of Corona Product of Two Paths
JTAM (Jurnal Teori dan Aplikasi Matematika)Graph labeling involves mapping the elements of a graph (edges and vertices) to a set of positive integers. The concept of an anti-magic super outer labeling (a,d)-H pertains to assigning labels to the vertices and edges of a graph using natural numbers {
Bela Zainun Yatin +2 more
doaj +3 more sources
Antimagic Labeling for Some Snake Graphs
Proyecciones (Antofagasta)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. In this paper we study antimagic labeling of double triangular snake, alternate triangular snake, double alternate triangular snake, quadrilateral snake, double ...
Chirag Barasara, Palak Prajapati
openaire +2 more sources
On super (a,d)-Ph-antimagic total labeling of Stars [PDF]
AKCE International Journal of Graphs and Combinatorics, 2015 Let G=(V,E) be a simple graph and H be a subgraph of G. G admits an H-covering, if every edge in E(G) belongs to at least one subgraph of G that is isomorphic to H. An (a,d)-H-antimagic total labeling of G is bijection f:V(G)∪E(G)→{1,2,3,…,|V(G)|+|E(G)|}
S. David Laurence, KM. Kathiresan
doaj +2 more sources
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
On Rainbow Vertex Antimagic Coloring of Graphs: A New Notion
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2021 All graph in this paper are simple, finite, and connected. Let be a labeling of a graph . The function is called antimagic rainbow edge labeling if for any two vertices and , all internal vertices in path have different weight, where the weight of ...
Marsidi Marsidi +3 more
doaj +1 more source
Every graph is local antimagic total and its applications [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling. A bijection \(g : E \to \{1,2,\ldots,q\}\) is called a local antimagic labeling of \(G\)
Gee-Choon Lau +2 more
doaj +1 more source
Antimagic labelings of caterpillars [PDF]
Applied Mathematics and Computation, 2019 13 pages, 4 ...
Lozano Boixadors, Antoni +2 more
openaire +6 more sources