Antimagic labeling of generalized pyramid graphs

详细信息    查看全文

• 作者：Subramanian Arumugam (1) (2) (3)
  Mirka Miller (4) (5) (6) (7)
  Oudone Phanalasy (4) (8)
  Joe Ryan (9)
  
• 关键词：Antimagic labeling ; generalized pyramid graph ; graph labeling construction ; 05C78
• 刊名：Acta Mathematica Sinica
• 出版年：2014
• 出版时间：February 2014
• 年：2014
• 卷：30
• 期：2
• 页码：283-290
• 全文大小：184 KB
• 作者单位：Subramanian Arumugam (1) (2) (3)
  Mirka Miller (4) (5) (6) (7)
  Oudone Phanalasy (4) (8)
  Joe Ryan (9)
  
  1. National Centre for Advanced Research in Discrete Mathematics, Kalasalingam University, Krishnankoil, 626 126, Tamil Nadu, India
  2. Department of Computer Science, Liverpool Hope University, Liverpool, L16 9JD, UK
  3. Department of Computer Science, Ball State University, Muncie, IN, 47306, USA
  4. School of Mathematical and Physical Sciences, University of Newcastle, Newcastle, NSW, 2308, Australia
  5. Department of Mathematics, University of West Bohemia, Pilsen, 30614, Czech Republic
  6. Department of Informatics, King鈥檚 College London, London, WC2R 2LS, UK
  7. Department of Mathematics, ITB, Bundung, 40132, Indonesia
  8. Department of Mathematics, National University of Laos, Vientiane, 01080, Laos
  9. School of Electrical Engineering and Computer Science, University of Newcastle, Newcastle, NSW, 2308, Australia
  
• ISSN：1439-7617

文摘

An antimagic labeling of a graph with q edges is a bijection from the set of edges to the set of positive integers {1, 2, ..., q} such that all vertex weights are pairwise distinct, where the vertex weight of a vertex is the sum of the labels of all edges incident with that vertex. A graph is antimagic if it has an antimagic labeling. In this paper, we provide antimagic labelings for a family of generalized pyramid graphs.