On identifying codes in the Cartesian product of a path and a complete graph |
| |
| Authors: | Jason Hedetniemi |
| |
| Institution: | 1.Clemson University,Clemson,USA |
| |
| Abstract: | Identifying codes in the Cartesian product of a complete graph and a path are considered. After proving a set of sufficient conditions for a set in such a graph to be an identifying code, we then construct minimum identifying codes when the complete graph is of order three or at least five, and when the path is of order at least three. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
