Minimum Self-Repairing Graphs |
| |
| Authors: | Arthur M Farley Andrzej Proskurowski |
| |
| Institution: | 1. Computer and Information Science Department, University of Oregon, Eugene, OR, 97403, USA
|
| |
| Abstract: | A graph is self-repairing if it is 2-connected and such that the removal of any single vertex results in no increase in distance between any pair of remaining vertices of the graph. We completely characterize the class of minimum self-repairing graphs, which have the fewest edges for a given number of vertices. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
