complete N-partite graph 完全多部图
regular graph of degree n 次正则图
n-connected graph n连通图
n-factorable graph n可因子分解图
n-color flower graph n色花形图
complete n-partition graph 完全n部图
n-order complete graph n阶完全图
The computational complexity of the improved algorithm approaches polynomial complexity, much less than 2 N ( N is the vertex number of a graph).
后者的计算时间复杂性远远低于2 N（N为图的顶点数） ，已接近于多项式时间复杂性。
Let G be a graph and let V(G) be the vertex set of G. Define the neighborhood complex N(G) as the simplicial complex whose simplices are those subsets of V(G) which have a common neighbor.
一个图G的邻域复形是以G的顶点为顶点，以G的具有公共邻接顶点的顶点子集为单形的抽象复形。
What is the maximum number of possible topological sorts of N-order Direct Acyclic Graph?
的n阶有向无环图的拓扑排序的可能的最大数量是多少？
应用推荐