Author:
Yu Shimin,Shao Fang-Ming,Meng Huajun
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. On the invulnerability of the regular complete k-partite graphs;Boesch;SIAM Appl. Math.,1971
2. On residual connectedness network reliability;Boesch,1991
3. The Combinatorics of Network Reliability;Colbourn,1987
4. On reliability of graphs with node failures;Goldschmidt;Networks,1994
5. Uniformly optimally reliable graphs;Gross;Networks,1998
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献