Name
Abstract | ||
|---|---|---|
A graph G=(V,E) is weighted-k-antimagic if for each w:V→R, there is an injective function f:E→{1,…,|E|+k} such that for each vertex u the following sums are all distinct: ∑v:uv∈Ef(uv)+w(u). When such a function f exists, it is called a (w,k)-antimagic labeling of G. A connected graph G is antimagic if it has a (w,0)-antimagic labeling where w(u)=0 for each u∈V. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.endm.2015.07.022 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
antimagic labeling,weighted antimagic labeling,algorithm | Discrete mathematics,Complete bipartite graph,Combinatorics,Injective function,Bound graph,Vertex (geometry),Graph factorization,Graph labeling,Connectivity,Mathematics,Edge-graceful labeling | Journal |
Volume | ISSN | Citations |
50 | 1571-0653 | 1 |
PageRank | References | Authors |
0.39 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martín Matamala | 1 | 158 | 21.63 |
| José Zamora | 2 | 7 | 5.95 |