摘要
本文运用图论中无向图的割边及连通性的理论，阐述无向图的主割边与次连通的概念，推导出若干有关性质，并给出一种在无向图中寻求一条欧拉路的有效方法─—取非主割边法。
Applying the Theory of the cut·edge and connectivity concerning non.directed graph in the graph theory, this paper introduces the concept of the principal cut-edge and secondary connectivity, derives several related properties, and puts forward an effective method to seek systematically a Euler￣'s path from the non-directed graph-the method of non-principal cut-edge.
出处
《赣南师范学院学报》
1994年第5期19-24,共6页
Journal of Gannan Teachers' College(Social Science(2))
关键词
主割边
次连通性
欧拉回路
欧拉通路
principal cut-edge,secondary connectivity,Euler￣'s circuit, Euler￣'s
