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.
Áreas temáticas de ASJC Scopus
- Matemáticas discretas y combinatorias
- Matemáticas aplicadas