综述无向简单图零度问题近年来所取得的研究进展。
This paper gave a review of recent developments in the study of nullities of undirected simple graphs.
推导出由特征多项式的系数表示的线图（无重边图）中圈的个数，双向结点对个数，单向结点对个数及简单图中有向三角形个数的计算公式，等等。
The formulae for the number of loops, edges, triangles, pairs of two-way nodes and pairs of one-way nodes are deduced by the coefficients of a characteristic polynomial, so on.
研究和实现了图论中无向图的简单路径查找算法，对连锁表的编制规则进行了总结，实现了相应的联锁表自动生成算法。
Based on the research of the rules to compose the interlocking table and simple path search of graph, we design an algorithm to generate the interlocking table from signal arrangement.
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (a).
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (a).
应用推荐