首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Super d-antimagic labelings of disconnected plane graphs
Authors:Martin Ba?a  Mirka Miller  Oudone Phanalasy  Andrea Semani?ová-Feňov?íková
Institution:(1) Division of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon;(2) Department of Computer Science, University of Tennessee, Knoxville, TN 37996, USA
Abstract:This paper deals with the problem of labeling the vertices, edges and faces of a plane graph in such a way that the label of a face and the labels of the vertices and edges surrounding that face add up to a weight of that face, and the weights of all s-sided faces constitute an arithmetic progression of difference d, for each s that appears in the graph.
Keywords:Plane graph  d-antimagic labeling  super d-antimagic labeling  disjoint union of graphs
本文献已被 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号