Results 61 to 70 of about 935 (138)
On the Integer-antimagic Spectra of Non-Hamiltonian Graphs
Theory and Applications of Graphs, 2022 Let $A$ be a nontrivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{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) = \Sigma$ $
Wai Shiu, Richard Low
doaj +1 more source
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 +1 more source
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 +3 more sources
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
Approximate results for rainbow labelings [PDF]
, 2015 Article de ...
Lladó Sánchez, Ana M.
core +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