Loading...
A New Lower Bound on the Minimum Density of Vertex Identifying Codes for the Infinite Hexagonal Grid
Cukierman, Ariel J.
Cukierman, Ariel J.
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.
Description
Thesis is part of Honors ETD pilot project, 2008-2013. Migrated from Dspace in 2016.
Date
2011-05-12
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Download Dataset
Rights Holder
Usage License
Embargo
Research Projects
Organizational Units
Journal Issue
Keywords
Graph theory, Vertex identifying code
Citation
Department
Mathematics