A d-antimagic labeling of a plane graph G = (V, E, F) is a one-to-one mapping taking the vertices, edges and fares onto the integers 1, 2,..., vertical bar V(G)vertical bar + vertical bar E(G)vertical bar + vertical bar F(G)vertical bar so that the s-sided face weights form an arithmetic progression of difference d. This paper describes d-antimagic labelings for Mobius grids.
机构:
Department of Applied Mathematics and Informatics, Technical University, KošiceDepartment of Applied Mathematics and Informatics, Technical University, Košice
Bača M.
论文数: 引用数:
h-index:
机构:
Phanalasy O.
Ryan J.
论文数: 0引用数: 0
h-index: 0
机构:
School of Electrical Engineering and Computer Science, University of Newcastle, NewcastleDepartment of Applied Mathematics and Informatics, Technical University, Košice
Ryan J.
Semaničová-Feňovčíková A.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Applied Mathematics and Informatics, Technical University, KošiceDepartment of Applied Mathematics and Informatics, Technical University, Košice