）．一个非平凡的道路p称为是一个有向圈（oriented cycle），若J（p）＝P（p）． 令kQ是一个以Q中路为基的k一向量空间．为使kQ作为一个k一代数有一个自 然的结构，我们定义k一线性映射f：豇...
基于12个网页-相关网页
通过有向图的邻接矩阵的轨道来刻划图的哈密顿圈问题。
According to the orbit of adjoining matrix of directed graph the problem of Hamiltonian cycle is described.
研究一类特殊的本原双色有向图，其未着色的有向图包含两个圈。
Special primitive two-colored digraphs whose uncolored digraph consist of two cycles are considered.
从边集合出发给出了计算有向基因组的圈图连通分支的线性时间算法。
An algorithm for computing the connected components of the cycle graph of the given two signed genomes is studied, which is more efficient than the primary algorithm.
应用推荐