Search or add a thesis

Advanced Search (Beta)
Home > Labeling of Graphs and Hypergraphs

Labeling of Graphs and Hypergraphs

Thesis Info

Access Option

External Link

Author

Javaid, Muhammad

Program

PhD

Institute

National University of Computer and Emerging Sciences

City

Karachi

Province

Sindh

Country

Pakistan

Thesis Completing Year

2013

Thesis Completion Status

Completed

Subject

Mathemaics

Language

English

Link

http://prr.hec.gov.pk/jspui/bitstream/123456789/2304/1/2526S.pdf

Added

2021-02-17 19:49:13

Modified

2024-03-24 20:25:49

ARI ID

1676726572472

Similar


An undirected graph G is said to be simple if it has no multi-edges and self-loops. If G is connected and has no cycles, it is called an acyclic graph or simply a tree. Labeling (or valuation) of a graph is a map that carries graph elements (vertices and edges) to numbers (usually positive integers). If a labeling uses the vertex-set (edge-set) only then it becomes a vertex-labeling (an edge-labeling), respectively. Labeling is called total if the domain consists of both vertex and edge sets. There are many types of graph labeling but this study emphasizes on antimagic and odd graceful labelings. Kotzig and Rosa have conjectured in a paper that every tree is edge-magic. Later on, Enomoto, Llado, Nakamigawa and Ringel have proposed the conjecture that every tree is a super (a, d)-edge-antimagic total graph when d = 0. Lee and Shah tried to prove this conjecture using computer but failed, they were able to verify it on trees of at most seventeen vertices. The current study is mainly devoted to investigate a super (a, d)-edge-antimagic total labeling of various subclasses of trees: subdivided stars, subdivided caterpillars and exten- ded w-trees. It is also proved that for different values of d the disjoint union of isomorphic and non-isomorphic copies of extended w-trees are super (a, d)-edge-antimagic total. Moreover, the existence of an odd graceful labeling is determined on disjoint union of cycles and paths. Hypergraphs are natural extension of graphs in which elements correspond to nodes (vertices), sets correspond to the edges which are allowed to connect more than two nodes. In this dissertation, a general idea related to the construction of linear h-uniform star hypergraphs is given and it is proved that disjoint union of h-uniform star hypergraphs admits an antimagic vertex labeling.
Loading...

Similar Thesis

Showing 1 to 20 of 100 entries
TitleAuthorSupervisorDegreeInstitute
PhD
National University of Computer and Emerging Sciences, Karachi, Pakistan
PhD
Government College University, Lahore, Pakistan
PhD
Government College University, Lahore, Pakistan
PhD
Government College University, Lahore, Pakistan
PhD
Government College University Lahore, Lahore, Pakistan
PhD
Government College University, Lahore, Pakistan
PhD
Government College University, Lahore, Pakistan
PhD
Government College University, Lahore, Pakistan
PhD
Government College University, Lahore, Pakistan
Mphil
Riphah International University, Faisalabad, Pakistan
Allama Iqbal Open University, Islamabad, Pakistan
Mphil
Riphah International University, Faisalabad, Pakistan
Mphil
Riphah International University, Faisalabad, Pakistan
PhD
Government College University, Lahore, Pakistan
University of Management and Technology, Lahore, Pakistan
Mphil
University of Management and Technology, Lahore, Pakistan
PhD
Government College University, Lahore, Pakistan
MS
University of Management and Technology, Lahore, Pakistan
Mphil
University of Management and Technology, Lahore, Pakistan
MS
University of Management and Technology, Lahore, Pakistan
TitleAuthorSupervisorDegreeInstitute
Showing 1 to 20 of 100 entries

Similar News

Loading...

Similar Articles

Loading...

Similar Article Headings

Loading...