1) undirected circulant graphs
无向循环图
1.
This paper discussed the number of spanning trees in the undirected circulant graphs with odd degrees, giving an analytic eppres-sion, an asymptotic result and an effective method to calculate the numbers.
本文首先讨论度数为奇数的无向循环图的支撑树计数问题，给出其解析表达式及渐近结果，并给出一有效方法来计算支撑树数目。
2) Directed Acyclic Probability-Correlation Graph
有向无循环概率相关图
3) Infinite circulant
无限循环图
4) circulant digraph
有向循环图
1.
This paper, we use matric expression of circulant digraph D(n,S).
本文利用有向循环图D（n,S）的矩阵表示,讨论了D（n,S）的一些谱性质。
5) Circulant Digraphs
循环有向图
6) directed acyclic graph
有向无环图
1.
Graph drawing algorithm for directed acyclic graphs based on genetic algorithm;
基于遗传算法的有向无环图画图算法
2.
Study on the simplified interpretative structural modeling method for the directed acyclic graph;
面向有向无环图的简化解释结构模型(SISM)法
3.
A new GA based drawing algorithm for directed acyclic graphs
一个新的基于GA的有向无环图画图算法
补充资料：循环系统的进化鱼的循环系统
李瑞端绘
[图]
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条