View Proposal #174
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
ID | 174 |
---|---|
First Name | Ryan |
Last Name | Martin |
Institution | Iowa State University |
Speaker Category | faculty |
Title of Talk | Vertex identifying codes in graphs: definitions, theorems and open problems |
Abstract | In 1998, Karpovsky, Chakrabarty and Levitin introduced a new graph invariant called the vertex identification code. If C is a subset of the vertices, then C is a vertex-identifying code if each set N[v]\cap C is distinct and nonempty, where N[v] denotes the closed neighborhood of vertex v. We will discuss a number of results on the size of the smallest code in a graph, particularly on the Erdos-Renyi random graph and we will present open problems. |
Subject area(s) | Graph Theory |
Suitable for undergraduates? | No |
Day Preference | |
Computer Needed? | |
Bringing a laptop? | |
Overhead Needed? | |
Software requests | |
Special Needs | |
Date Submitted | 3/20/2006 |
Year | 2006 |