Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. Graphs as models of communication network vulnerability: connectivity and persistence;Boesch;Networks,1981
2. A counterexample to a conjecture on paths of bounded length;Boyles;J. Graph Theory,1982
3. Problem in Proceedings of Sixth Hungarian Colloquim on Combinatorics;Chung,1981
4. Geodetic connectivity of graphs;Entringer;IEEE Trans. Circuits and Systems,1977
5. On diameter stability of graphs;Hartman;Theory and Applications of Graphs, Springer Lecture Notes No. 642,1978
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献