Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBashir, Fozia-
dc.description.abstractThe thesis 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 vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called d-antimagic if for every positive integer s, the s-sided face weights form an arithmetic progression with a difference d. Such a labeling is called super if the smallest possible labels appear on the vertices. The thesis is devoted to study of super d-antimagic labelings of type (1, 1, 1) for antiprisms and disjoint union of prisms. We consider the antiprism and prism as three cycle parts: the outer cycle, the inner cycle and the middle cycle. To label the inner, the outer and the middle cycles we use the edge-antimagic total labelings and the vertex-antimagic total labelings. These labelings combine to a resulting super d-antimagic labeling of type (1, 1, 1) for the required values of difference d.en_US
dc.description.sponsorshipHigher Education Commission, Pakistan.en_US
dc.subjectNatural Sciencesen_US
dc.subjectGeneral principles of mathematicsen_US
dc.titleFace Labelings of Graphsen_US
Appears in Collections:PhD Thesis of All Public / Private Sector Universities / DAIs.

Files in This Item:
File Description SizeFormat 
260S.pdfComplete Thesis608.67 kBAdobe PDFView/Open
260S-0.pdfTable of contents57.12 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.