Super d-antimagic labelings of disconnected plane graphs

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. The paper examines the existence of such labelings for disjoint union of plane graphs. © 2010 Institute of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Chinese Mathematical Society and Springer-Verlag Berlin Heidelberg.

Año de publicación:

2010

Keywords:

• Super d-Antimagic labeling
• D-antimagic labeling
• Plane graph
• disjoint union of graphs

Fuente:

scopus