Results 121 to 130 of about 201,420 (145)

A Generalized Version of a Local Antimagic Labelling Conjecture

Graphs and Combinatorics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kasper Szabo Lyngsie, Liang Zhong
openaire   +3 more sources

On \(d\)-antimagic labelings of prisms.

Ars Comb., 2004
Let \(G\) be a plane graph with \(v\) vertices, \(e\) edges, and \(f\) faces. We label each vertex, each edge, and each face with exactly one number from the set \(\{1, 2, \ldots , v+e+f\}\). The weight of a face is the sum of labels of the face itself together with labels of vertices and edges surrounding that face.
Lin, Y., Slamin, Baca, M., Miller, M.
openaire   +2 more sources

(a, d)-Distance Antimagic Labeling of Some Types of Graphs

Cybernetics and Systems Analysis, 2016
Досліджено необхідні умови існування (a, d)-дистанційної антимагічної розмітки графа G = (V, E) порядку n. Одержано теореми, що розширюють сімейство не (a, d)-дистанційних антимагічних графів.
Семенюта, М.Ф.
exaly   +1 more source

Some Distance Antimagic Labeled Graphs

2016
Let G be a graph of order n. A bijection $$f:VG \longrightarrow \{1, 2, \ldots , n\}$$ is said to be distance antimagic if for every vertex v the vertex weight defined by $$w_fv =\sum _{x\in Nv}fx$$ is distinct. The graph which admits such a labeling is called a distance antimagic graph. For a positive integer k, define $$f_{k}:VG \longrightarrow \{1+k,
Adarsh K. Handa, Aloysius Godinho, Tarkeshwar Singh   +2 more
openaire   +2 more sources

Super Face Antimagic Labelings of Union of Antiprisms

Mathematics in Computer Science, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Baca, Muhammad Numan, Muhammad Kamran Siddiqui   +2 more
openaire   +2 more sources

Edge-Antimagic Total Labelings

2019
This chapter focuses on edge-antimagic graphs under both vertex labelings and total labelings. Super edge-antimagic total labelings are given for standard graphs and (a,1) edge-antimagic total labelings are introduced and explored.
Martin Bača, Mirka Miller, Joe Ryan, Andrea Semaničová-Feňovčíková   +3 more
openaire   +1 more source

Antimagic labeling of subdivided caterpillars

Bulletin of the Malaysian Mathematical Sciences Society
An antimagic labeling of a graph $G=(V, E)$ of size \(m\) is a one-to-one mapping $f:E\to\{1, 2,\dots,m\}$, such that all vertices receive pairwise distinct vertex sums, where a vertex sum of a vertex $v$ in $G$ is the sum of the labels on the edges incident to $v$. A graph is called antimagic if it admits an antimagic labeling.
Wu, Canbin, Deng, Kecai, Zhao, Qinghong
openaire   +2 more sources

Vertex-Antimagic Total Labelings

2019
Following the chapters on magic type labelings, this chapter begins the section of the book devoted to antimagic labelings. Vertex antimagic and super vertex antimagic labelings, both edge labels and total labels are investigated with labeling constrictions given for connected and disconnected graphs.
Martin Bača, Mirka Miller, Joe Ryan, Andrea Semaničová-Feňovčíková   +3 more
openaire   +1 more source

Total balanced antimagic labeling

Journal of Combinatorial Mathematics and Combinatorial Computing
<p>Let <span class="math inline">\(G\)</span> be a graph. We introduce the <span>balanced antimagic labeling</span> as an analogue to the antimagic labeling. A <span><span class="math inline">\(k\)</span>-total balanced antimagic</span> labelling is a map <span class="math inline">\(c\colon V (
Sylwia Cichacz, Rita Zuazua
openaire   +1 more source

Antimagic labeling of forests with sets of consecutive integers

Discrete Applied Mathematics, 2022
Wei-Tian Li
exaly