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

Author

Ariel J. Cukierman, College of William and MaryFollow

Date Thesis Awarded

5-2011

Access Type

Honors Thesis -- Access Restricted On-Campus Only

Degree Name

Bachelors of Science (BS)

Department

Mathematics

Advisor

Gexin Yu

Committee Members

Christopher D. Carone

Ilya Spitkovsky

Abstract

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.

Recommended Citation

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.
https://scholarworks.wm.edu/honorstheses/387

Creative Commons License

This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.

Comments

Thesis is part of Honors ETD pilot project, 2008-2013. Migrated from Dspace in 2016.