Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6871145 | Discrete Applied Mathematics | 2018 | 8 Pages |
Abstract
In this work, we prove that all the complete bipartite graphs Kp,q, are weighted-0-antimagic when 2â¤pâ¤q and qâ¥3. Moreover, an algorithm is proposed that computes in polynomial time a (w,0)-antimagic labeling of the graph. Our result implies that if H is a complete partite graph, with Hâ K1,q, K2,2, then any connected graph G containing H as a spanning subgraph is antimagic.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
MartÃn Matamala, José Zamora,