| 由基本割集矩阵求其对应图G的一种算法 |
| |
| 引用本文： | 吴康.由基本割集矩阵求其对应图G的一种算法[J].安徽大学学报(自然科学版),1984(1). |
| |
| 作者姓名： | 吴康 |
| |
| 摘 要： | 本文给出判定含全“1”元素列和不会全“1”元素列两种基本割集矩阵是否有其对应图的充要条件。当满足此条件时,怎样由矩阵得到图,文中给出了一种依据此条件而构造的算法,并给出两个例子来说明这种算法的应用。
|
AN ALGORITHM FOR FORMING A GRAPH BY ITS FUNDAMENTAL CUTSET MATRIX |
| |
| Abstract: | The sufficient and necessary conditions are given in the article to determine if the two kinds of fundamental cutset matrixes—the one which contains the column which is entirely composed of "1" element and the one which does not—have their respecctive graph G.If the conditionis is gratified, how to get the graph from the matrix? An algorithm is shown in the article, which is formed according to the conditions, and two examples are given to illustrate the applicaton of the algorithm. |
| |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ |
|
