Antimagic Labeling of Generalized Pyramid Graphs

作     者：Subramanian ARUMUGAM Mirka MILLER Oudone PHANALASY Joe RYAN 

作者机构：National Centre for Advanced Research in Discrete MathematicsKalasalingam University Department of Computer ScienceLiverpool Hope University Department of Computer ScienceBall State University Muncie School of Mathematical and Physical SciencesUniversity of Newcastle Department of MathematicsUniversity of West Bohemia Department of InformaticsKing’s College London Department of Mathematics Department of MathematicsNational University of Laos School of Electrical Engineering and Computer ScienceUniversity of Newcastle 

出 版 物：《Acta Mathematica Sinica,English Series》 (数学学报（英文版）)

年 卷 期：2014年第30卷第2期

页      面：283-290页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：Antimagic labeling generalized pyramid graph graph labeling construction 

摘      要：An antimagic labeling of a graph withq 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 *** this paper,we provide antimagic labelings for a family of generalized pyramid graphs.