Home
Add
Get on Google Play
Home
> Edit
Add/Update Thesis
Title*
Author's Name*
Supervisor's Name
Abstract
The 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.
Subject/Specialization
Language
Program
Faculty/Department's Name
Institute Name
Univeristy Type
Public
Private
Campus (if any)
Institute Affiliation Inforamtion (if any)
City where institute is located
Province
Country
Degree Starting Year
Degree Completion Year
Year of Viva Voce Exam
Thesis Completion Year
Thesis Status
Completed
Incomplete
Number of Pages
Urdu Keywords
English Keywords
Link
Select Category
Religious Studies
Social Sciences & Humanities
Science
Technology
Any other inforamtion you want to share such as Table of Contents, Conclusion.
Your email address*