Results 1 to 10 of about 118 (84)
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
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 Elegant Labelling and Magic Labelling of Large-Scale Graphs
Discrete Dynamics in Nature and Society, 2022 In this paper, we deduce the equivalence relationship among strongly c-elegant labelling, super-edge magic total labelling, edge antimagic total labelling, and super t,1-magical labelling.
Jing Su, Hongyu Wang, Bing Yao
doaj +2 more sources
On (a,1)-Vertex-Antimagic Edge Labeling of Regular Graphs
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 +2 more sources
On the antimagicness of generalized edge corona graphs [PDF]
HeliyonGiven a graph G, a function of assigning distinct labels {1,2,...,|E(G)|} to E(G) such that w(a)≠w(b), ∀ a,b∈V(G) is an antimagic labeling of G where w(a) indicates the vertex sum obtained by summing up all the labels assigned to the edges incident on ...
Nivedha D, Devi Yamini S
doaj +2 more sources
On local distance antimagic labeling of graphs
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be a graph of order n and let [Formula: see text] be a bijection. For every vertex [Formula: see text], we define the weight of the vertex v as [Formula: see text] where N(v) is the open neighborhood of the vertex v. The bijection
Aloysius Godinho, Tarkeshwar Singh
exaly +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
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
Local edge (a, d) –antimagic coloring on sunflower, umbrella graph and its application
Alifmatika, 2023 Suppose a graph G = (V, E) is a simple, connected and finite graph with vertex set V(G) and an edge set E(G). The local edge antimagic coloring is a combination of local antimagic labelling and edge coloring.
Robiatul Adawiyah +2 more
doaj +1 more source
Assignment Computations Based on Cexp Average in Various Ladder Graphs
Journal of Mathematics, Volume 2022, Issue 1, 2022., 2022 This study introduces the Cexp average assignments and investigates its properties using various ladder graphs. The ladder graphs can be found in every communication networks. Ladder networks are increasingly being used in everyday life for monitoring and environmental applications such as domestic, military, surveillance, industrial, medical ...
A.Rajesh Kannan +5 more
wiley +1 more source