Back to search

University of North Texas

Cycles and Cliques in Steinhaus Graphs

Abstract

dc:description

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.

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
1994

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lim, Daekeun
Contributors dc:contributor
  • Brand, Neal E.
  • Monticino, Michael G.
  • Jackson, Steve, 1957-
  • Das, Sajal K.
  • Kung, Joseph P. S.

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • Public
  • Copyright
  • Copyright is held by the author, unless otherwise noted. All rights reserved.
  • Lim, Daekeun
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
call-no: 379 N81d no.4040
untcat: b1839037
local-cont-no: 1002720609-lim
ark: ark:/67531/metadc278469

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Lim, Daekeun. Cycles and Cliques in Steinhaus Graphs. University of North Texas, 1994. https://digital.library.unt.edu/ark:/67531/metadc278469/