Results 61 to 70 of about 580,661 (153)
SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED TRIBUN GRAPH [PDF]
, 2015 . A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a bijection f:V(G)∪E(G)⟶{1,2,…,p+q} such that the edge-weights, w(uv)=f(u)+f(v)+f(uv), uv∈E(G), form an arithmetic sequence with first term a and common ...
Slamin, S +2 more
core +1 more source
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
Distance antimagic labeling of join and corona of two graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices .
A.K. Handa +3 more
doaj +1 more source
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
SUPER (a,d)-EDGE-ANTIMAGIC TOTAL LABELING OF SILKWORM GRAPH [PDF]
, 2015 . An  (a, d)-edge-antimagic  total  labeling  of G  is a  one-to-one  mapping taking the vertices and edges onto {1, 2, 3, . . . , p + q} Such that the edge-weights w(uv)  = (u)+(v)+(uv), uv ∈ E(G)  form an arithmetic sequence {a, a+d, a ...
Slamin, S, Hadi, Dian Anita, Dafik, D
core +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
Weighted antimagic labeling [PDF]
, 2017 A graph G = (V, E) is weighted-k-antimagic if for each w : V -> R, there is an injective function f : E -> {1,...,vertical bar E vertical bar + k} such that the following sums are all distinct: for each vertex u, Sigma(v:uv is an element of E)f (uv) + w ...
José Zamora +3 more
core +1 more source
Cauchy: Jurnal Matematika Murni dan AplikasiThis article discusses a local antimagic coloring which is a combination between antimagic labeling and coloring. It is a new notion. We define a vertex weight of as where is the set of edges incident to .
R. Sunder +5 more
doaj +1 more source
Super (a; d)-star-antimagic graphs
Hacettepe Journal of Mathematics and Statistics, 2018 Summary: A simple graph \(G=(V,E)\) admitting an \(H\)-covering is said to be \((a,d)\)-\(H\)-antimagic if there exists a bijection \(f : V \cup E \rightarrow \{1,2,\dots,|V| + |E|\}\) such that, for all subgraphs \(H'\) of \(G\) isomorphic to \(H\), \(wt_f(H') = \sum_{v \in V(H')}f(v)+\sum_{e \in E(H')}f(e)\), form an arithmetic progression \(a\), \(a+
SELVAGOPAL, Pothukutti Nadar +3 more
openaire +3 more sources
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