Results 21 to 30 of about 909,592 (58)

Another Antimagic Conjecture

, 2021
An antimagic labeling of a graph G is a bijection f:E(G)→{1,…,|E(G)|} such that the weights w(x)=∑y∼xf(y) distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1990) is that every connected graph other than K2 admits an antimagic ...
Tamaro Nadeak, Kristiana Wijaya, Nurdin Hinding, Kiki Ariyanti Sugeng, Fuad Yasin, Rinovia Simanjuntak   +5 more
core   +1 more source

Antimagic Labelings of Caterpillars [PDF]

, 2019
A $k$-antimagic labeling of a graph $G$ is an injection from $E(G)$ to $\{1,2,\dots,|E(G)|+k\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $u$ is the sum of the labels assigned to edges incident to $u$.
Seara Ojea, Carlos, Seara, Carlos, Mora, Mercè, Lozano Boixadors, Antoni, Mora Giné, Mercè, Lozano, Antoni, Lozano Bojados, Antoni   +6 more
core   +1 more source

The antimagic orientation problems for graphs obtained by some graph operations

, 2020
A simple graph $G$ is said to admit an antimagic orientation if there exist an orientation on the edges of $G$ and a bijection from $E(G)$ to $\{1,2,\ldots,|E(G)|\}$ such that the vertex sums of vertices are pairwise distinct, where the vertex sum of a vertex is defined to be the sum of the labels of the in-edges minus that of the out-edges incident to
Dhananjaya, Eranda, Li, Wei-Tian
openaire   +2 more sources

Antimagic Labeling of Some Degree Splitting Graphs [PDF]

, 2023
A graph with q edges is called antimagic if its edges can be labeled with 1, 2, 3, ..., q without repetition such that the sums of the labels of the edges incident to each vertex are distinct.  As Wang et al.
Prajapati, Palak, Chirag Barasara, Palak Prajapati, Barasara, Chirag   +3 more
core   +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, Martín Matamala, Matamala, Martín, Zamora, José   +3 more
core   +1 more source

ANTIMAGIC LABELING OF DIGRAPHS [PDF]

, 2016
An antimagic labeling of a digraph D with p vertices and q arcs is a bin f from the set of all arcs to the set of positive integers such that all the p oriented vertex weights are distinct, where an oriented vertex weight is the sum of the labels of ...
Nalliah Moviri
core   +1 more source

Antimagic Labeling of Forests [PDF]

, 2023
An antimagic labeling of a graph G(V,E) is a bijection f mapping from E to the set {1,2,…, |E|}, so that for any two different vertices u and v, the sum of f(e) over all edges e incident to u, and the sum of f(e) over all edges e incident to v, are ...
Liu, Daphne Der-Fen, Sierra, Johnny, Toy, Jessica   +2 more
core   +1 more source

COMPLEMENTARY TOTALLY ANTIMAGIC TOTAL GRAPHS

, 2017
<p>For a graph G, with the vertex set V(G) and the edge set E(G), a total labeling is a bijection f from V (G) U E(G) to the set of integers {1, 2, …, |V (G) |+| E(G) |}.
Mallikarjun Ghaleppa*, Danappa G Akka
core   +1 more source

Group-antimagic Labelings of Multi-cyclic Graphs [PDF]

, 2016
Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagic} if there exists an edge labeling $f: E(G) \to A \backslash \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \Sigma$
Low, Richard M., Roberts, Dan, Dan Roberts, Richard Low   +3 more
core   +1 more source

Pewarnaan Lokal Wilayah Super Antimagic Pada Graf Planar

, 2018
Konsep pewarnaan graf puncaknya muncul pada tahun 1976, yaitu sebagai hasil dari pemecahan persoalan 4 warna. Setelahnya muncul konsep pelabelan graf.
RATRI, Arum Andary
core