| 图的线独立数的一个公式 |
| |
| 引用本文： | 李建湘. 图的线独立数的一个公式[J]. 经济数学, 1993, 0(1) |
| |
| 作者姓名： | 李建湘 |
| |
| 作者单位： | 邵阳工业专科学校 湖南 |
| |
| 摘 要： | 本文中我们用等秩变换证明了连通图G的所有生成树的邻接矩阵的秩中最大者就是图G线独立数的两倍。特别,我们给出了连通图G具有完美匹配的一个新的充要条件。
|
| 关 键 词： | 线独立数 生成树 邻接矩阵的秩 等秩变换 |
A Formula of The Line Independence Number of A Graph |
| |
| Li Jianxiang. A Formula of The Line Independence Number of A Graph[J]. Mathematics in Economics, 1993, 0(1) |
| |
| Authors: | Li Jianxiang |
| |
| Affiliation: | Shaoyang Politechnic College Hunan 422001 |
| |
| Abstract: | In this Paper it is Proved by the rank transformation that maximum rank of the adjacent matrixes of all spanning trees of a connected graph G is twice the line independence number of the graph G. In particular, a new necessary and sufficient condition is given for a connected graph G containing a perfect matching. |
| |
| Keywords: | Line independence number Spanning trees Rank of adjacent matrix Rank transformation |
| 本文献已被 CNKI 等数据库收录！ |
