Antimagic labeling graphs with a regular dominating subgraph

详细信息    查看全文

• 作者：Radek Sl¨ªva
• 关键词：Combinatorial problems ; Antimagic labeling ; Antimagic graphs ; Dominating subgraph
• 刊名：Information Processing Letters
• 出版年：2012
• 出版时间：15 November, 2012
• 年：2012
• 卷：112
• 期：21
• 页码：844-847
• 全文大小：132 K

文摘

An antimagic labeling of a connected graph with ? edges is an injective assignment of labels from to the edges such that the sums of incident labels are distinct at distinct vertices. Hartsfield and Ringel conjectured that every connected graph other than has an antimagic labeling. Motivated by a result of Barrus for split graphs we prove the conjecture for graphs with a regular dominating subgraph.