In this dissertation several results in Steinhaus graphs are investigated. First under some further conditions imposed on the induced cycles in steinhaus graphs, the order of induced cycles in Steinhaus graphs is at most [(n+3)/2]. Next the results of maximum clique size in Steinhaus graphs are used to enumerate the Steinhaus graphs having maximal cliques. Finally the concept of jumbled graphs and Posa's Lemma are used to show that almost all Steinhaus graphs are Hamiltonian.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc278469 |
| Date | 12 1900 |
| Creators | Lim, Daekeun |
| Contributors | Brand, Neal E., Monticino, Michael G., Jackson, Steve, 1957-, Das, Sajal K., Kung, Joseph P. S. |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | iii, 71 leaves, Text |
| Rights | Public, Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved., Lim, Daekeun |
Page generated in 0.0021 seconds