On constructing a spanning Eulerian superstructure
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1994
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16153 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| 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. |
|---|