Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.endm.2017.10.028 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Antimagic graphs,split graphs,complete bipartite graphs | Pseudoforest,Discrete mathematics,Combinatorics,Line graph,Forbidden graph characterization,Bipartite graph,Cograph,1-planar graph,Universal graph,Mathematics,Pancyclic graph | Journal |
Volume | ISSN | Citations |
62 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martín Matamala | 1 | 158 | 21.63 |
| José Zamora | 2 | 7 | 5.95 |