Results 51 to 60 of about 1,609,249 (128)
Lexicographic product graphs P m [ P n ] are antimagic
AKCE International Journal of Graphs and Combinatorics, 2018 A graph with q edges is called a n t i m a g i c if its edges can be labeled with 1, 2, …, q such that the sums of the labels on the edges incident to each vertex are distinct.
Wenhui Ma +3 more
doaj +2 more sources
Distance antimagic labelings of Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph of order n. Let be a bijection. The weight w(v) of a vertex v with respect to the labeling f is defined by where N(v) is the open neighborhood of v. The labeling f is called a distance antimagic labeling if for any two distinct vertices v1,
Nancy Jaseintha Cutinho +2 more
doaj +1 more source
NOTE ON SUPER \((a,1)\)–\(P_3\)–ANTIMAGIC TOTAL LABELING OF STAR \(S_n\)
Ural Mathematical Journal, 2021 Let \(G=(V, E)\) be a simple graph and \(H\) be a subgraph of \(G\). Then \(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
S. Rajkumar +2 more
doaj +1 more source
Palindromic Antimagic Labeling of Products of Paw and Banner Graph
Contemporary MathematicsThis article presents a novel classification of Antimagic labeling referred to as Palindromic antimagic. Palindromic Antimagic labeling pertains to the assignment of palindromic numbers {℘1, ℘2, ℘3 . . .
P. Reka, S. P. Soundariya
semanticscholar +1 more source
Distance antimagic labelings of product graphs
Electronic Journal of Graph Theory and Applications, 2023 Summary: A graph \(G\) is distance antimagic if there is a bijection \(f : V(G) \rightarrow \{1, 2, \dots, |V(G)|\}\) such that for every pair of distinct vertices \(x\) and \(y\) applies \(w(x) \neq w(y)\), where \(w(x)= \sum_{z \in N(x)}f(z)\) and \(N(x)\) is the neighbourhood of \(x\), i.e., the set of all vertices adjacent to \(x\).
Wulandari, Risma Yulina +1 more
openaire +2 more sources
On distance labelings of 2-regular graphs
Electronic Journal of Graph Theory and Applications, 2021 Let G be a graph with |V(G)| vertices and ψ : V(G) → {1, 2, 3, ... , |V(G)|} be a bijective function. The weight of a vertex v ∈ V(G) under ψ is wψ(v) = ∑u ∈ N(v)ψ(u). The function ψ is called a distance magic labeling of G, if wψ(v) is a constant for
Anak Agung Gede Ngurah +1 more
doaj +1 more source
Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph
Jurnal Ilmu Dasar, 2015 Let G be a simple graph of order p and size q. Graph G is called an (a,d)-edge-antimagic totalifthereexistabijectionf :V(G)∪E(G)→{1,2,...,p+q}suchthattheedge-weights,w(uv)= f(u)+f(v)+f(uv); u, v ∈ V (G), uv ∈ E(G), form an arithmetic sequence with first ...
Djoni Budi Sumarno +2 more
doaj +1 more source
Weighted antimagic labeling: an algorithmic approach
Electronic Notes in Discrete Mathematics, 2015 Abstract A graph G = ( V , E ) is weighted-k-antimagic if for each w : V → R , there is an injective function f : E → { 1 , … , | E | + k } such that for each vertex u the following sums are all distinct: ∑ v : u v ∈ E f ( u v ) + w ( u ) .
Martín Matamala, José Zamora
openaire +1 more source
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 +1 more source
Super Total Labeling (a,d)- edge Antimagic on the Firecracker Graph
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2020 An (a, d)-edge-antimagic total labeling on (p, q)-graph G is a one-to-one map f from V (G) ∪ E(G) onto the integers 1, 2, . . . , p + q with the property that the edge-weights, w(uv) = f (u)+ f (v) + f (uv) where uv ∈ E(G),form an arithmetic ...
Juhari Juhari
doaj +1 more source