Results 61 to 70 of about 412,708 (144)
A Super (A,D)-Bm-Antimagic Total Covering of Ageneralized Amalgamation of Fan Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2017 All graph in this paper are finite, simple and undirected. Let G, H be two graphs. A graph G is said to be an (a,d)-H-antimagic total graph if there exist a bijective function such that for all subgraphs H’ isomorphic to H, the total H-weights form an ...
Ika Hesti Agustin +3 more
doaj +1 more source
Regular handicap graphs of order n ≡ 4 (mod 8)
Electronic Journal of Graph Theory and Applications, 2022 A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f : V → {1, 2, …, n} with the property that f(xi)=i, the weight w(xi) is the sum of labels of all neighbors of xi, and the sequence of the weights w(x1),w(x2),…,w(
Dalibor Froncek, Aaron Shepanik
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
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
Local total anti-magic chromatic number of graphs
Heliyon, 2023 Let G=(V,E) be a graph without isolated vertices and let |V(G)|=n and |E(G)|=m. A bijection π:V(G)∪E(G)→{1,2,....,n+m} is said to be local total anti-magic labeling of a graph G if it satisfies the conditions: (i.) for any edge uv, ω(u)≠ω(v), where u and
V. Sandhiya, M. Nalliah
doaj +1 more source
Antimagic Orientation of Biregular Bipartite Graphs
The Electronic Journal of Combinatorics, 2017 An antimagic labeling of a directed graph $D$ with $n$ vertices and $m$ arcs is a bijection from the set of arcs of $D$ to the integers $\{1, \cdots, m\}$ such that all $n$ oriented vertex sums are pairwise distinct, where an oriented vertex sum is the sum of labels of all arcs entering that vertex minus the sum of labels of all arcs leaving it.
Songling Shan, Xiaowei Yu
openaire +4 more sources
A generalization of magic and antimagic labelings of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2019 A k-magic labeling of a finite, simple graph with and is a bijection from the set of edges into the integers such that the vertex set can be partitioned into sets and each vertex in the set has the same vertex sum and any two distinct vertices in different sets have different vertex sum, where a vertex sum is the sum of the labels of all edges incident
C. Meenakshi, KM. Kathiresan
openaire +3 more sources
Orientable -distance magic regular graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj +1 more source
Complete characterization of graphs with local total antimagic chromatic number 3 [PDF]
Opuscula MathematicaA total labeling of a graph \(G = (V, E)\) is said to be local total antimagic if it is a bijection \(f: V\cup E \to\{1,\ldots,|V|+|E|\}\) such that adjacent vertices, adjacent edges, and pairs of an incident vertex and edge have distinct induced weights
Gee-Choon Lau
doaj +1 more source