Degree Type

Dissertation

Date of Award

2011

Degree Name

Doctor of Philosophy

Department

Mathematics

First Advisor

Ryan Martin

Abstract

For any position integer r, an r-identifying code on a graph G is a set C which is a subset of V(G) such that the intersection of the radius-r closed neighborhood with C is nonempty and pairwise distinct. For a finite graph, the density of a code is |C|/|V(G)|, which extends naturally to a definition of density on certain infinite graphs which are locally finite. This thesis explores the concept of density on certain infinite graphs, each of which have a representation on an n-dimensional lattice and finds some new bounds for these densities.

Copyright Owner

Brendon Stanton

Language

en

Date Available

2012-04-30

File Format

application/pdf

File Size

94 pages

Included in

Mathematics Commons

Share

COinS