| Digital Archive

Account:

Search the Digital Archive

A New Lower Bound on the Minimum Density of Vertex Identifying Codes for the Infinite Hexagonal Grid

Show full item record

Author: Cukierman, Ariel J.
Advisor: Yu, Gexin
Committee Members: Carone, Christopher D.; Spitkovsky, Ilya
Issued Date: 5/12/2011
Subjects: Graph theory
Vertex identifying code
URI: http://hdl.handle.net/10288/13693
Description: The study of vertex identifying codes is grounded in graph theory and has applications in the design of multiprocessor networks. Roughly speaking, a vertex identifying code is a way of labeling the vertices of a graph. We are particularly interested in infinite graphs, e.g., the square, triangular and hexagonal grids.
Degree: Bachelors of Science in Mathematics


Files in this item

Files Size Format View Description
CukiermanAri2011.pdf 3.151Mb PDF View/Open Thesis
CukiermanAri2011CoverSheet.pdf 12.07Kb PDF View/Open Cover Sheet

This item appears in the following Collection(s)

Show full item record