Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Steinhaus graphs). Showing records 1 – 2 of 2 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of North Texas

1. Lim, Daekeun. Cycles and Cliques in Steinhaus Graphs.

Degree: 1994, University of North Texas

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. Advisors/Committee Members: Brand, Neal E., Monticino, Michael G., Jackson, Steve, 1957-, Das, Sajal K., Kung, Joseph P. S..

Subjects/Keywords: Steinhaus graphs; mathematics; Graph theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lim, D. (1994). Cycles and Cliques in Steinhaus Graphs. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278469/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lim, Daekeun. “Cycles and Cliques in Steinhaus Graphs.” 1994. Thesis, University of North Texas. Accessed August 05, 2020. https://digital.library.unt.edu/ark:/67531/metadc278469/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lim, Daekeun. “Cycles and Cliques in Steinhaus Graphs.” 1994. Web. 05 Aug 2020.

Vancouver:

Lim D. Cycles and Cliques in Steinhaus Graphs. [Internet] [Thesis]. University of North Texas; 1994. [cited 2020 Aug 05]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278469/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lim D. Cycles and Cliques in Steinhaus Graphs. [Thesis]. University of North Texas; 1994. Available from: https://digital.library.unt.edu/ark:/67531/metadc278469/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of North Texas

2. Simmons, Dayton C. (Dayton Cooper). Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory.

Degree: 1993, University of North Texas

In this dissertation the results of Jerrum and Sinclair on the conductance of Markov chains are used to prove that almost all generalized Steinhaus graphs are rapidly mixing and an algorithm for the uniform generation of 2 - (4k + 1,4,1) cyclic Mendelsohn designs is developed. Advisors/Committee Members: Brand, Neal E., Monticino, Michael G., Das, Sajal K., Bilyeu, Russell Gene, Kung, Joseph P. S..

Subjects/Keywords: Markov chains; mathematics; Steinhaus graphs; Markov processes.; Graph theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Simmons, D. C. (. C. (1993). Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc277740/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Simmons, Dayton C (Dayton Cooper). “Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory.” 1993. Thesis, University of North Texas. Accessed August 05, 2020. https://digital.library.unt.edu/ark:/67531/metadc277740/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Simmons, Dayton C (Dayton Cooper). “Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory.” 1993. Web. 05 Aug 2020.

Vancouver:

Simmons DC(C. Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory. [Internet] [Thesis]. University of North Texas; 1993. [cited 2020 Aug 05]. Available from: https://digital.library.unt.edu/ark:/67531/metadc277740/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Simmons DC(C. Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory. [Thesis]. University of North Texas; 1993. Available from: https://digital.library.unt.edu/ark:/67531/metadc277740/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.