No Detail Found!

Super magic and antimagic labelings of disjoint union of plane graphs*

Author(s)
Ali Ahmad College of Computer and Information system, Jazan University, Jazan, Saudi Arabia
Martin Baca Department of Appl. Mathematics and Informatics, Technical University, Košice, Slovak Republic ; Abdus Salam School of Mathematical Sciences, G. C. University, Lahore, Pakistan
Marcela Lascsáková Department of Appl. Mathematics and Informatics, Technical University, Košice, Slovak Republic
Andrea Semanicová-Fenovcíková Department of Appl. Mathematics and Informatics, Technical University, Košice, Slovak Republic ; Abdus Salam School of Mathematical Sciences, G. C. University, Lahore, Pakistan
Abstract
Suppose G is a finite plane graph with vertex set V(G) and edge set E(G). A d-antimagic labeling of type (1,1,0) of G is a one-to-one map from V(G)ÈE(G) onto the integers 1,2,…,|V(G)|+|E(G)with the property that the labels of the vertices and edges surrounding the face add up to a weight of that face and the weights of all s-sided faces form an arithmetic progression of difference d. A d-antimagic labeling is called super if the smallest possible labels appear on the vertices. In this paper, we investigate the existence of super d-antimagic labelings of type (1,1,0) for disjoint union of plane graphs for several values of difference d. *The work was supported by Higher Education Commission Pakistan Grant HEC(FD)/2007/555 and by Slovak VEGA Grant 1/0130/12.
Publication Details
Page(s) 21-25
DOI DOI not available
Published Journal: Science International, Volume: 24, Issue: 1, Year: 2012

Request the full text from PASTIC

0

Citations

0

Downloads

95

Views