On constructing a spanning Eulerian superstructure
Date of Publication
1994
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 is concerned about the construction of a spanning eulerian supergraph, given a subeulerian graph. Subeulerian graphs are graphs which span eulerian supergraphs. Any multigraph, disconnected or not, is a subeulerian graph. A graph which is not spanned by K 2m+1,2n+1' in the connected case and is not K1 UK2n+1, in the disconnected case, is subeularian. The exact number of additional edges required to obtain any eulerian super (multi) graph in each of these cases can be derived by the method of pairing odd vertices together.Results of this thesis are originally given by C.L. Suffel in his article The Spanning Subgraphs of Eulerian Graphs, inspired by the Chinese Postman Problem posed by mathematician Meiko Kuan. The researchers gave a detailed explanation of these results, hoping to come up with a simpler approach to the problem.
Abstract Format
html
Language
English
Format
Accession Number
TU06634
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
65 leaves
Keywords
Graph theory; Structures, Theory of; Euler angles; Combinatorial analysis
Recommended Citation
Almoninia, G. T., & Galian, M. F. (1994). On constructing a spanning Eulerian superstructure. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16153