Some results on clique partitions of regular graphs
Date of Publication
1999
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
This thesis discusses the partitioning of the edges of a simple connected 3-regular graph into a minimum number of complete subgraphs. This is called a minimum clique partition of the graph. Results are focused on various techniques in obtaining the exact values and bounds of the size of a minimum clique partition of a 3-regular graph. A discussion on externally adjacent vertices and separation of cliques is also presented.
Abstract Format
html
Language
English
Format
Accession Number
TU09234
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
70 leaves
Recommended Citation
Escaner, J. E., & Inocencio, A. R. (1999). Some results on clique partitions of regular graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16566
