Results 11 to 20 of about 1,609,249 (128)

Distance antimagic labeling of circulant graphs

AIMS Mathematics
A distance antimagic labeling of graph $ G = (V, E) $ of order $ n $ is a bijection $ f:V(G)\rightarrow \{1, 2, \ldots, n\} $ with the property that any two distinct vertices $ x $ and $ y $ satisfy $ \omega(x)\ne\omega(y) $, where $ \omega(x) $ denotes ...
Syafrizal Sy, Rinovia Simanjuntak, Tamaro Nadeak, K. A. Sugeng, Tulus Tulus   +4 more
semanticscholar   +3 more sources

Antimagic Labeling of Digraphs

Mathematics and Statistics
Ancy Dsouza, Saumya Y M, K. Kumudakshi
semanticscholar   +2 more sources

Shifted-Antimagic Labelings for Graphs [PDF]

Graphs and Combinatorics, 2021
The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic. Some graphs are known to be antimagic, but little has been known about sparse graphs, not even trees.
Fei-Huang Chang, Hong-Bin Chen, Wei-Tian Li, Zhishi Pan   +3 more
openaire   +3 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   +1 more source

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, Liliek Susilowati, Dafik Dafik, M. Venkatachalam   +3 more
doaj   +1 more source

Antimagic Labeling of Some Degree Splitting Graphs

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   +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, Ika Hesti Agustin, Dafik Dafik, Elsa Yuli Kurniawati   +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, Karl Schaffer, Wai Chee Shiu   +2 more
doaj   +1 more source

On the study of Rainbow Antimagic Coloring of Special Graphs

Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023
Let  be a connected graph with vertex set  and edge set . The bijective function  is said to be a labeling of graph where  is the associated weight for edge .
Dafik Dafik, Riniatul Nur Wahidah, Ermita Rizki Albirri, Sharifah Kartini Said Husain   +3 more
doaj   +1 more source

PEWARNAAN TITIK TOTAL SUPER ANTI-AJAIB LOKAL PADA GRAF PETERSEN DIPERUMUM P(n,k) DENGAN k=1,2

Barekeng, 2021
The local antimagic total vertex labeling of graph G is a labeling that every vertices and edges label by natural number from 1 to  such that every two adjacent vertices has different weights, where is The sum of a vertex label and the labels of all ...
Deddy Setyawan, Anis Nur Afni, Rafiantika Megahnia Prihandini, Ermita Rizki Albirri, Arika Indah Kristiana   +4 more
doaj   +1 more source