Antimagicness of Lexicographic Product Graph G[Pn]

被引：0
作者：
Ying-yu Lu
Guang-hua Dong
Ning Wang
机构：
[1] Tiangong University,School of Mathematical Sciences
[2] Lushan College of Guangxi University of Science and Technology,Department of Information Science and Technology
[3] Tianjin University of Finance and Economics,undefined
来源：
Acta Mathematicae Applicatae Sinica, English Series | 2020年 / 36卷
关键词：
antimagic; labeling; lexicographic product; 05C15; 05C78;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Hartsfield and Ringel conjectured that every connected graph other than K2 is antimagic. Since then, many classes of graphs have been proved to be antimagic. But few is known about the antimagicness of lexicographic product graphs. In this paper, via the construction of a directed Eulerian circuit, the Siamese method, and some modification on graph labeling, the antimagicness of lexicographic product graph G[Pn] is obtained.
引用
收藏
页码：603 / 619
页数：16
相关论文
共 48 条
  • [1] Alón N(2004)Dense graphs are antimagic J. Graph Theory 47 297-309
  • [2] Kaplan G(2014)Antimagic labeling of generalized pyramid graphs Acta Math. Sin. (Engl. Ser.) 30 283-290
  • [3] Lev A(2017)Local antimagic vertex coloring of a graph Graphs Combin. 33 1-11
  • [4] Roditty Y(2015)Antimagic labelings of join graphs Math. Comput. Sci. 9 139-143
  • [5] Yuster R(2016)Antimagic labeling of regular graphs J. Graph Theory 82 339-349
  • [6] Arumugam S(2008)A new class of antimagic Cartesian product graphs Discrete Math. 308 6441-6448
  • [7] Miller M(2010)On antimagic directed graphs J. Graph Theory 64 219-232
  • [8] Phanalasy O(2009)On zero-sum partitions and anti-magic trees Discrete Math. 309 2010-2014
  • [9] Ryan J(2014)Anti-magic labeling of trees Discrete Math. 331 9-14
  • [10] Arumugam S(2013)Anti-magic labelling of Cartesian product of graphs Theoret. Comput. Sci. 477 1-5
12345