Identifying vertices in graphs and digraphs
The closed neighbourhood of a vertex in a graph is the vertex together with the set of adjacent vertices. A di®erentiating-dominating set, or identifying code, is a collection of vertices whose intersection with the closed neighbour- hoods of each vertex is distinct and nonempty. A di®erentiating...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
2009
|
| Subjects: | |
| Online Access: | Skaggs, Robert Duane (2009) Identifying vertices in graphs and digraphs, University of South Africa, Pretoria, <http://hdl.handle.net/10500/2226> http://hdl.handle.net/10500/2226 |