L(2, 1)-labeling of some special graphs
Date of Publication
2007
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Yvette Fajardo-Lim
Defense Panel Chair
Severino V. Gervacio
Defense Panel Member
Junie T. Go
Anita C. Ong
Abstract/Summary
The L(2, 1)-labeling of a graph G is a mapping f : (V(G) → Z* such that | f(u) - f(v) | ≥ 2 if d(u, v) = 1 and | f(u) - f(v) | ≥1 if d(u,v) = 2. The L(2, 1)-labeling, number of G, denoted by λ(G), is the smallest number k such that G has an L(2, 1)-labeling with f(v) ≤ k for all v ϵ V(G). This paper aims to present the L(2,1)-labeling and optimal L(2,1)-labeling of paths, cycles, wheels, complete graphs, trees, stars and hypercubes. All of the mentioned graphs are generalized except hypercube. The article entitled Labeling Graphs with a Condition at Distance 2, by Griggs and Yeh, served as the reference for this study.
Abstract Format
html
Language
English
Format
Accession Number
TU14188
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
viii, 47 leaves : ill.
Keywords
Graph theory
Recommended Citation
Juan, J. P., & Padilla, J. I. (2007). L(2, 1)-labeling of some special graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/17473
