Date of Publication
2-23-2004
Document Type
Master's Thesis
Degree Name
Master of Science in Mathematics
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Leonor A. Ruivivar
Defense Panel Chair
Yvette F. Lim
Defense Panel Member
Erminda C. Fortes
Isagani B. Jos
Abstract/Summary
The thesis presents some characterizations for a graph to be a k-simplex graph. The first theorem gives a characterization of the existence of a simplex-edge cover, satisfying three properties, for a graph to be a k-simplex graph. The split graphs Hj , for some positive integers j will be classified as k-simplex graph. The second part deals with the closure property of the k-simplex operator Dk.
Abstract Format
html
Language
English
Format
Electronic
Accession Number
CDTG003639
Shelf Location
Archives, The Learning Commons, 12F Henry Sy Sr. Hall
Physical Description
1 computer optical disc ; 4 3/4 in.
Keywords
Graph theory
Upload Full Text
wf_yes
Recommended Citation
Bernardo, S. D. (2004). A common generalization of line graphs and clique graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_masteral/3137
