Scholarlink

A graph G is antimagic if it’s m edges are labeled from 1 through m, so that the sum of the labels of the edges incident to each vertex differ. Hartsfield and Ringel (Pearls in Graph Theory, pp.108–110. Academic, San Diego, 1990) put forth the idea of antimagic graph labeling in 1990. In this paper, generalized honeycomb torus, pancake graph, and braid graph are shown to be antimagic.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Antimagic Labeling of Network Graphs

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • N. K. Vinodhini,
  • J. Jeba Jesintha,
  • Y. Princy

摘要

A graph G is antimagic if it’s m edges are labeled from 1 through m, so that the sum of the labels of the edges incident to each vertex differ. Hartsfield and Ringel (Pearls in Graph Theory, pp.108–110. Academic, San Diego, 1990) put forth the idea of antimagic graph labeling in 1990. In this paper, generalized honeycomb torus, pancake graph, and braid graph are shown to be antimagic.