| 1. | Another matrix associated with g is the adjacency matrix .
伴随于G的另一个矩阵是邻接矩阵。 |
| 2. | Another matrix associated with g is the adjacency matrix
伴随于g的另一个矩阵是邻接矩阵。 |
| 3. | A graph is called integral if and only if all the zeros of its characteristic polynomial are integral
所谓整图，就是指其邻接矩阵的特征值都是整数的图。 |
| 4. | It has given a method to the solution of instantaneous center using adjacency matrix and the calculation is computer - operated
给出了一种利用邻接矩阵求机构瞬心的方法，并可在计算机上实施。 |
| 5. | In this paper , a new algorithm is given to find fraquent 2 - itemset by adjacency matrix with less times scanning the database
同时，提出了一种用邻接矩阵产生频繁2项集的方法，可以减少扫描数据库的次数。 |
| 6. | Perhaps existing two arcs above in the same direction between two states , adjacency matrix could only record one of them
原因是两个状态间可能有两条以上同方向的弧，而邻接矩阵只能记录两个状态间存在的一条弧。 |
| 7. | This paper sets forth the two methods for topology analysis : neighboring matrix method and tree _ search method , which are in common use
本文详细地阐述了网络拓扑分析中两种常用的分析方法：邻接矩阵法和树搜索法。 |
| 8. | Although the adjacency matrix was a storage structure of finite automaton in common use , it was not proper to store all kinds of finite automata
摘要尽管邻接矩阵是有穷自动机的一种常用存储方法，但是，邻接矩阵并不适合存储所有类型的有穷自动机。 |
| 9. | Relations between the concept of nodal point distance and the connectedness of graph , connected component of graph are presented , and a method of how to compute two nodal points distance is also given
摘要文章分析了无向图中结点的距离与图的连通性、图的邻接矩阵之间的关系，并且给出了求两个结点距离的一种方法。 |
| 10. | The orientation path and residual network were defined , the new maximum flow algorithm in network with both node and edge capacity confined was put forward based on feasible flow decompose theorem and by way of the search in artificial intelligence
定义了有向路径和残量网络的概念，依据可行流分解定理，引入人工智能中搜索的方法，以邻接矩阵为网络数据存储结构，提出条件约束下的网络最大流新算法。 |
