in locally connected graphs 在本地连接图
simple connected graphs 简单连通图
maximal connected graphs 极大连通图
hamilton-connected graphs 哈密尔顿连通图
Ordering Connected Graphs 连通图的排序
critical connected graphs 临界连通图
hamilton connected graphs 哈密尔连通图
critically h-connected graphs 临界h连通图
k-regular k-connected graphs k正则k连通图
Throughout this thesis we consider finite undirected simple connected graphs.
我们考虑的都是有限无向的简单连通图。
参考来源 - 前三个最大特征值的3树和图类（？）（n，m）·2,447,543篇论文数据，部分数据来源于NoteExpress
Contractible edges and removable edges in connected graphs are a powerful tool to study the structures of connected graphs and to prove some properties of connected graphs by induction.
图的可收缩边与可去边是研究连通图的构造和使用归纳法证明连通图的一些性质的有力工具。
In this paper, some properties of removable edge in 4-connected graphs are obtained.
给出了4连通图中可去边的一些性质。
The topological sorting algorithm works on unconnected graphs as well as connected graphs.
拓扑排序算法既可以用于连通图，也可以用于非连通图。
应用推荐