1. Minimizing vulnerability in a communication network;Bedrosian,1964
2. Maximizing the number of spanning trees in a graph with n nodes and m edges;Shier;Journal of Res. of the National Bureau of Standards-B. Math Scien.,1974
3. On networks with the maximum numbers of trees;Leggett,1965
4. Generating formulas for the number of trees in a graph;Bedrosian;J. Franklin Inst.,1964
5. Comparison of graphs by their number of spanning trees;Kelmans;Discrete Math.,1976