Results 51 to 60 of about 412,708 (144)
Regular Graphs of Odd Degree Are Antimagic [PDF]
Journal of Graph Theory, 2014 AbstractAn antimagic labeling of a graph G with m edges is a bijection from to such that for all vertices u and v, the sum of labels on edges incident to u differs from that for edges incident to v. Hartsfield and Ringel conjectured that every connected graph other than the single edge K2 has an antimagic labeling.
Daniel W. Cranston +2 more
openaire +3 more sources
Some constructions of supermagic graphs using antimagic graphs [PDF]
, 2005 . AgraphG is called supermagic if it admits a labelling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex, the weight of vertex, is independent of the particular vertex.
Andrea Semaničová +3 more
core +1 more source
D-Antimagic Labelings of Oriented 2-Regular Graphs [PDF]
Given an oriented graph $\overrightarrow{G}$ and $D$ a distance set of $\overrightarrow{G}$, $\overrightarrow{G}$ is $D$-antimagic if there exists a bijective vertex labeling such that the sum of all labels of the $D$-out-neighbors of each vertex is ...
Simanjuntak, Rinovia +1 more
core +4 more sources
List-antimagic labeling of vertex-weighted graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that $f(e)\in L(e)$ for ...
Zhanar Berikkyzy +4 more
doaj +1 more source
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 This paper is dedicated to studying the following question: Is it always possible to injectively assign the weights 1, ..., |E(G)| to the edges of any given graph G (with no component isomorphic to K2) so that every two adjacent vertices of G get ...
Julien Bensmail +2 more
doaj +1 more source
The antimagicness of the Cartesian product of graphs
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuchen Zhang, Xiaoming Sun 0001
openaire +3 more sources
JTAM (Jurnal Teori dan Aplikasi Matematika)Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik +5 more
doaj +1 more source
The Integer-antimagic Spectra of a Weak Join of Hamiltonian Graphs
Theory and Applications of GraphsA simple graph $G$ with vertex set $V(G)$ and edge set $E(G)$ is \emph{$\mathbb{Z}_{k}$-antimagic} if there exists a function $f: E(G) \to \mathbb{Z}_{k} \backslash \{0\}$ such that the induced function $f^+(v)=\sum_{uv\in E(G)} f(uv)$ is injective. The \
Ugur Odabasi +2 more
doaj +1 more source
Distance antimagic labelings of product graphs
Electronic Journal of Graph Theory and Applications, 2023 A graph G is distance antimagic if there is a bijection f : V(G)→{1, 2, …, |V(G)|} such that for every pair of distinct vertices x and y applies w(x)≠w(y), where w(x)=Σ z ∈ N(x)f(z) and N(x) is the neighbourhood of x, i.e., the set of all vertices ...
Risma Yulina Wulandari +1 more
doaj +1 more source
On H‐Supermagic Labelings of m‐Shadow of Paths and Cycles
International Journal of Mathematics and Mathematical Sciences, Volume 2019, Issue 1, 2019., 2019 A simple graph G = (V, E) is said to be an H‐covering if every edge of G belongs to at least one subgraph isomorphic to H. A bijection f : V ∪ E → {1,2, 3, …, |V| + |E|} is an (a,d)‐H‐antimagic total labeling of G if, for all subgraphs H′ isomorphic to H, the sum of labels of all vertices and edges in H′ form an arithmetic sequence {a, a + d, …, (k − 1)
Ika Hesti Agustin +6 more
wiley +1 more source