Search or add a thesis

Advanced Search (Beta)
Home > Face Labelings of Graphs

Face Labelings of Graphs

Thesis Info

Access Option

External Link

Author

Bashir, Fozia

Program

PhD

Institute

Government College University

City

Lahore

Province

Punjab

Country

Pakistan

Thesis Completing Year

2005

Thesis Completion Status

Completed

Subject

Mathemaics

Language

English

Link

http://prr.hec.gov.pk/jspui/handle/123456789/223

Added

2021-02-17 19:49:13

Modified

2024-03-24 20:25:49

ARI ID

1676726193514

Similar


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.
Loading...
Loading...

Similar News

Loading...

Similar Articles

Loading...

Similar Article Headings

Loading...