Publisher
Springer Science and Business Media LLC
Reference19 articles.
1. Bauer, D., Boesch, F.T., Suffel, C., Tindell, R. Connectivity extremal problems and the design of reliable probabilistic networks. In: the Theory and Application of Graphs, G. Chartrand, Y. Alavi, D. Goldsmith, L. Lesniak Foster, and D. Lick, eds. Wiley, New York, 1981, 45–54
2. Boesch, F. On unreliability polynomials and graph connectivity in reliable network synthesis. J. Graph Theory, 10: 339–352 (1986)
3. Bondy, J.A., Murty, U.S.R. Graph Theory with Application. Elsevier, New York, 1976
4. Chartrand, G. A graph-theoretic approach to a communications problem. SIAM J. Appl. Math., 14: 778–781 (1966)
5. Chen, Z., Su, G., Volkmann, L. Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs. Discrete Appl. Math., 218: 64–70 (2017)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Path Connectivity Assessment Based on Continuous Sniffing;2022 4th International Academic Exchange Conference on Science and Technology Innovation (IAECST);2022-12-09