Optimal K-secure graphs |
| |
| Authors: | G. Gunther B.L. Hartnell |
| |
| Affiliation: | Department of Mathematics, Sir Wilfred Grenfell College, Memorial University of Newfoundland, Corner Brook, Newfoundland A2H 6P9, Canada |
| |
| Abstract: | We wish to design a resistance movement in such a way that k subversions and the resulting betrayals do not totally destroy our network. Such graphs will be called k-secure. Subject to this restriction we determine which graphs minimize the expected number of betrayals. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
