Results 71 to 80 of about 201,420 (145)
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
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 vertex labelings of hypergraphs
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +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
Distance Antimagic Labeling of the Ladder Graph
Electronic Notes in Discrete Mathematics, 2017 Abstract Let G be a graph of order n. Let f : V ( G ) → { 1 , 2 , … , n } be a bijection. The weight w f ( v ) of a vertex with respect to f is defined by w f ( v ) = ∑ x ∈ N ( v ) f ( x ) . The labeling f is said to be distance antimagic if w f ( u ) ≠ w f (
Adarsh K. Handa +2 more
openaire +1 more source
On k-shifted antimagic spider forests
Let G(V,E) be a simple graph with m edges. For a given integer k, a k-shifted antimagic labeling is a bijection f:E(G)→{k+1,k+2,…,k+m} such that all vertices have different vertex-sums, where the vertex-sum of a vertex v is the total of the labels ...
Fei-Huang Chang, Wei-Tian Li, Daphne Der-Fen Liu, Zhishi Pan
core +1 more source
On distance antimagic labeling of graphs [PDF]
, 2016 Досліджується антимагічний тип вершинної розмітки графа. Для циркулянтних графів знайдена необхідна умова, а для голландського вітряка – необхідна і достатня умови існування (a, d)-дистанційної антимагічної розмітки.Исследуется антимагический тип ...
Семенюта, М.Ф.
core +2 more sources
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
Local antimagic vertex coloring of unicyclic graphs
Indonesian Journal of Combinatorics, 2018 The local antimagic labeling on a graph G with |V| vertices and |E| edges is defined to be an assignment f : E --> {1, 2,..., |E|} so that the weights of any two adjacent vertices u and v are distinct, that is, w(u)̸ ̸= w(v) where w(u) = Σe∈E(u) f(e)
Nuris Hisan Nazula, S Slamin, D Dafik
doaj +1 more source