Back to search

East Tennessee State University

Finding Edge and Vertex Induced Cycles within Circulants.

Abstract

dc:description.abstract

Let H be a graph. G is a subgraph of H if V (G) ⊆ V (H) and E(G) ⊆ E(H). The subgraphs of H can be used to determine whether H is planar, a line graph, and to give information about the chromatic number. In a recent work by Beeler and Jamison [3], it was shown that it is difficult to obtain an automorphic decomposition of a triangle-free graph. As many of their examples involve circulant graphs, it is of particular interest to find triangle-free subgraphs within circulants. As a cycle with at least four vertices is a canonical example of a triangle-free subgraph, we concentrate our efforts on these. In this thesis, we will state necessary and sufficient conditions for the existence of edge induced and vertex induced cycles within circulants.

Degree

thesis:*
Name thesis:degree_name
MS (Master of Science)
Level thesis:degree_level
Thesis - unrestricted
Discipline thesis:degree_discipline
Mathematical Sciences
Year dc:date.issued
2008

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wooten, Trina Marcella

Subjects

dc:subject × 7

Rights

dc:rights
Statement dc:rights
  • Copyright by the authors.

Identifiers

dc:identifier.*
Repository record dc:identifier
https://dc.etsu.edu/etd/1985

Chain of custody

source
Harvested from
East Tennessee State University
Base URL
dc.etsu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Wooten, Trina Marcella. Finding Edge and Vertex Induced Cycles within Circulants.. Thesis - unrestricted thesis, 2008. https://dc.etsu.edu/etd/1985