Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903507 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
MartÃn Matamala, José Zamora,