Results 101 to 110 of about 935 (138)

Graph antimagic labeling: A survey

Discrete Mathematics, Algorithms and Applications, 2023
An antimagic labeling of a simple graph [Formula: see text] is a bijection [Formula: see text] such that [Formula: see text] for any two vertices [Formula: see text] in [Formula: see text]. We survey the results about antimagic labelings and other labelings motivated by antimagic labelings of graphs, and present some conjectures and open questions.
Jin, Jingxiang, Tu, Zhuojie
openaire   +2 more sources

Antimagic Labelings of Join Graphs

Mathematics in Computer Science, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bača, Martin, Phanalasy, Oudone, Ryan, Joe, Semaničová-Feňovčíková, Andrea   +3 more
openaire   +1 more source

Face Antimagic Labeling of Jahangir Graph

Mathematics in Computer Science, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Siddiqui, Muhammad Kamran, Numan, Muhammad, Umar, Muhammad Awais   +2 more
openaire   +1 more source

Graceful and Antimagic Labelings

2019
This chapter explores the relationship between antimagic labeling and alpha labelings and also the well-known graceful labelings. Much of this chapter looks at interesting labelings and structures on trees, including edge antimagic trees, alpha trees, and disjoint union of caterpillars.
Martin Bača, Mirka Miller, Joe Ryan, Andrea Semaničová-Feňovčíková   +3 more
openaire   +1 more source

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

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

Antimagic labelling of vertex weighted graphs

Journal of Graph Theory, 2011
AbstractSuppose G is a graph, k is a non‐negative integer. We say G is k‐antimagic if there is an injection f: E→{1, 2, …, |E| + k} such that for any two distinct vertices u and v, . We say G is weighted‐k‐antimagic if for any vertex weight function w: V→ℕ, there is an injection f: E→{1, 2, …, |E| + k} such that for any two distinct vertices u and v, .
Wong, Tsai-Lien, Zhu, Xuding
openaire   +1 more source

Vertex-antimagic labelings of regular graphs

Acta Mathematica Sinica, English Series, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmad, Ali, Ali, Kashif, Bača, Martin, Kovář, Petr, Semaničová-Feňovčíková, Andrea   +4 more
openaire   +2 more sources

Distance Antimagic Labelings of Graphs

2017
Let \(G=(V,E)\) be a graph of order n. Let \(f: V(G)\rightarrow \{1,2,\dots ,n\}\) be a bijection. For any vertex \(v \in V,\) the neighbor sum \(\sum \limits _{u\in N(v)}f(u)\) is called the weight of the vertex v and is denoted by w(v). If \(w(x) \ne w(y)\) for any two distinct vertices x and y, then f is called a distance antimagic labeling. A graph
N. Kamatchi, G. R. Vijayakumar, A. Ramalakshmi, S. Nilavarasi, S. Arumugam   +4 more
openaire   +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   +1 more source