查询词典 planar graph

circulant flow：回圈流

circuit graph 回路图 | circulant flow 回圈流 | circulant graph 回圈图

journal citing half life+graph：期刊引用半衰期与图解

journal cited half life+graph 期刊被引半衰期与图解 | journal citing half life+graph 期刊引用半衰期与图解 | journal immediacy index 期刊立即指数

closed graph theorem：闭图定理

closed graph 闭图 | closed graph theorem 闭图定理 | closed group 闭群

closed graph：闭图

closed geodesic 闭测地线 | closed graph 闭图 | closed graph theorem 闭图定理

the complementary graph of forest：森林的补图

树的补图:the complementary graph of tree | 森林的补图:the complementary graph of forest | 长链互补引物:Long complementary primers

the complementary graph of tree：树的补图

显性互补基因:Complementary Dominant Genes | 树的补图:the complementary graph of tree | 森林的补图:the complementary graph of forest

complete graph：完全图

所谓完全图(complete graph)就是任意2个结点之间都有边的图,见图(a);所谓偶图(bipartite graph)就是可以把全部结点分成两个不相交的集合,所有边的两个端点分属于这两个集合的图,见图(b).

Complete 5-partite graph：完全5分图

完全多部图:The complete n-partite graph | 完全5分图:Complete 5-partite graph | 人的全面发展:human"s complete development

connected component：连通分量

连通分量(connected component): 无向图(undirected graph)中的最大连通子图叫做一个连通分量,例如下图中的连通分量为3强连通分量(strongly connected component): 如果有向图(derected graph)中任意一个节点都存在到达其它每个节点的路径,

connected graph：连通图

节点不重复出现的链称为路径(path);在有向图中,节点不重复出现且链中所有弧的方向一致,则称为有向路径(directed path)无向图中,若任意两点间至少存在一条路径,则称为连通图(connected graph),否则为非连通图( discon-nected graph);

aseptically drawn milk：在无菌条件下挤出的乳

aseptic | 防腐剂 无菌的 | aseptically drawn milk | 在无菌条件下挤出的乳 | asepticism | 无菌法, 无菌外科学说

digital refurbishing frequency：数据刷新速度

额定输出 rated output | 数据刷新速度 digital refurbishing frequency | 通讯波制率 communication BPS