Date Thesis Awarded
Honors Thesis -- Access Restricted On-Campus Only
Bachelors of Science (BS)
Christopher D. Carone
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.
Cukierman, Ariel J., "A New Lower Bound on the Minimum Density of Vertex Identifying Codes for the Infinite Hexagonal Grid" (2011). Undergraduate Honors Theses. William & Mary. Paper 387.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.
On-Campus Access Only