# Graphs admitting antimagic labeling for arbitrary sets of positive integers

Martín Matamala, José Zamora

### Resumen

A connected graph G=(V,E) with m edges is called universal antimagic if for each set B of m positive integers there is an bijective function f:E→B such that the function f˜:V→N defined at each vertex v as the sum of all labels of edges incident to v is injective. In this work we prove that several classes of graphs are universal antimagic. Among others, paths, cycles, split graphs, and any graph which contains the complete bipartite graph K2,n as a spanning subgraph.

Idioma original English 159-164 6 Electronic Notes in Discrete Mathematics 62 https://doi.org/10.1016/j.endm.2017.10.028 Published - 1 nov 2017

### Huella dactilar

Labeling
Split Graph
Spanning Subgraph
Integer
Complete Bipartite Graph
Bijective
Arbitrary
Graph in graph theory
Injective
Connected graph
Labels
Cycle
Path
Vertex of a graph
Class

### ASJC Scopus subject areas

• Discrete Mathematics and Combinatorics
• Applied Mathematics

### Citar esto

@article{898e90e77d274e0ca0d6945908b7a527,
title = "Graphs admitting antimagic labeling for arbitrary sets of positive integers",
abstract = "A connected graph G=(V,E) with m edges is called universal antimagic if for each set B of m positive integers there is an bijective function f:E→B such that the function f˜:V→N defined at each vertex v as the sum of all labels of edges incident to v is injective. In this work we prove that several classes of graphs are universal antimagic. Among others, paths, cycles, split graphs, and any graph which contains the complete bipartite graph K2,n as a spanning subgraph.",
keywords = "Antimagic graphs, complete bipartite graphs, split graphs",
author = "Mart{\'i}n Matamala and Jos{\'e} Zamora",
year = "2017",
month = "11",
day = "1",
doi = "10.1016/j.endm.2017.10.028",
language = "English",
volume = "62",
pages = "159--164",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",

}

En: Electronic Notes in Discrete Mathematics, Vol. 62, 01.11.2017, p. 159-164.

TY - JOUR

T1 - Graphs admitting antimagic labeling for arbitrary sets of positive integers

AU - Matamala, Martín

AU - Zamora, José

PY - 2017/11/1

Y1 - 2017/11/1

N2 - A connected graph G=(V,E) with m edges is called universal antimagic if for each set B of m positive integers there is an bijective function f:E→B such that the function f˜:V→N defined at each vertex v as the sum of all labels of edges incident to v is injective. In this work we prove that several classes of graphs are universal antimagic. Among others, paths, cycles, split graphs, and any graph which contains the complete bipartite graph K2,n as a spanning subgraph.

AB - A connected graph G=(V,E) with m edges is called universal antimagic if for each set B of m positive integers there is an bijective function f:E→B such that the function f˜:V→N defined at each vertex v as the sum of all labels of edges incident to v is injective. In this work we prove that several classes of graphs are universal antimagic. Among others, paths, cycles, split graphs, and any graph which contains the complete bipartite graph K2,n as a spanning subgraph.

KW - Antimagic graphs

KW - complete bipartite graphs

KW - split graphs

UR - http://www.scopus.com/inward/record.url?scp=85032438469&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2017.10.028

DO - 10.1016/j.endm.2017.10.028

M3 - Article

AN - SCOPUS:85032438469

VL - 62

SP - 159

EP - 164

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

ER -