Results 51 to 60 of about 201,420 (145)
On super --antimagic total labeling of disjoint union of cycles
AKCE International Journal of Graphs and Combinatorics, 2018 Let and be finite simple graphs where every edge of belongs to at least one subgraph that is isomorphic to . An --antimagic total labeling of a graph is a bijection such that for all subgraphs isomorphic to , the -weights, form an arithmetic progression ...
Faisal Susanto
doaj +2 more sources
On the Construction of the Reflexive Vertex k‐Labeling of Any Graph with Pendant Vertex
International Journal of Mathematics and Mathematical Sciences, Volume 2020, Issue 1, 2020., 2020 A total k‐labeling is a function fe from the edge set to first natural number ke and a function fv from the vertex set to non negative even number up to 2kv, where k = max{ke, 2kv}. A vertex irregular reflexive k -labeling of a simple, undirected, and finite graph G is total k‐labeling, if for every two different vertices x and x′ of G, wt(x) ≠ wt(x′),
I. H. Agustin +5 more
wiley +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\).
Risma Yulina Wulandari +1 more
openaire +3 more sources
Antimagicness for a family of generalized antiprism graphs
Electronic Journal of Graph Theory and Applications, 2014 An antimagic labeling of a graph $G=(V,E)$ is a bijection from the set of edges $E$ to the set of integers $\{1,2,\dots, |E|\}$ such that all vertex weights are pairwise distinct, where the weight of a vertex is the sum of all edge labels incident with ...
Dominique Buset +3 more
doaj +1 more source
A note on incomplete regular tournaments with handicap two of order n≡8(mod 16) [PDF]
Opuscula Mathematica, 2017 A \(d\)-handicap distance antimagic labeling of a graph \(G=(V,E)\) with \(n\) vertices is a bijection \(f:V\to \{1,2,\ldots ,n\}\) with the property that \(f(x_i)=i\) and the sequence of weights \(w(x_1),w(x_2),\ldots,w(x_n)\) (where \(w(x_i)=\sum_{x_i
Dalibor Froncek
doaj +1 more source
On (a,d)-antimagic labelings of Hn, FLn and mCn
Indonesian Journal of Combinatorics, 2020 In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic.
Ramalakshmi Rajendran, K. M. Kathiresan
doaj +1 more source
Integer-antimagic spectra of disjoint unions of cycles
Theory and Applications of Graphs, 2018 Let $A$ be a non-trivial abelian group. A simple graph $G = (V, E)$ is $A$-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) = \sum_{uv\in E(G)}f(uv ...
Wai Chee Shiu
doaj +1 more source
Odd and Even Ratio Edge Antimagic Labeling [PDF]
, 2013 In this paper we introduce a new labeling namely odd and even ratio edge antimagic labeling and study the existence of this labeling for basic graph structures ...
Jayapriya, Jayapal, Thirusangu, K.
core +1 more source
On Super Edge-Antimagicness of Subdivided Stars
Discussiones Mathematicae Graph Theory, 2015 Enomoto, Llado, Nakamigawa and Ringel (1998) defined the concept of a super (a, 0)-edge-antimagic total labeling and proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph.
Raheem A., Javaid M., Baig A.Q.
doaj +1 more source
lnteger-antimagic Labeling of Graphs
, 2022 Let A be a non-trivial abelian group. A connected simple graph G = (V, E) is A-antimagic, ifthere exists an edge labeling : () → \{0} such that the induced vertex labeling +() =Σ{,}∈ () ({, }) is a one-to-one map.
Odabaşı, Uğur
core