Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference19 articles.
1. The expected number of pairs of connected nodes: Pair-connected reliability;Amin;Math. Comput. Model.,1993
2. On the roots of Wiener polynomials of graphs;Brown;Discrete Math.,2018
3. Network resilience;Colbourn;SIAM J. Algebraic Discrete Methods,1987
4. Location of zeros of Wiener and distance polynomials;Dehmer;PLoS One,2012
5. Chromatic Polynomials and Chromaticity of Graphs;Dong,2005
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Survey of Recent Extremal Results on the Wiener Index of Trees;Match Communications in Mathematical and in Computer Chemistry;2024