| 强正则图的途径计数和邻接矩阵分类 |
| |
| 引用本文： | 扈生彪.强正则图的途径计数和邻接矩阵分类[J].宝鸡文理学院学报(自然科学版),2002,22(3):165-166,190. |
| |
| 作者姓名： | 扈生彪 |
| |
| 作者单位： | 青海民族学院,应用数学系,青海,西宁,810007 |
| |
| 基金项目： | 青海省教育厅资助项目;200008; |
| |
| 摘 要： | 强正则图的邻接矩阵A的方幂Am可以表示为A,单位矩阵和全1矩阵的线性组合,进而由该表达式得到强正则图的任意两点之间任意长的途径计数公式,最后给出强正则图的邻接矩阵的奇异性和非奇异性分类.
|
| 关 键 词： | 强正则图 本原矩阵 邻接矩阵 |
| 文章编号： | 1007-1261(2002)03-0165-02 |
The number of walks and classification of adjacency matrix of strongly regular graph |
| |
| HU Sheng,biao.The number of walks and classification of adjacency matrix of strongly regular graph[J].Journal of Baoji College of Arts and Science(Natural Science Edition),2002,22(3):165-166,190. |
| |
| Authors: | HU Sheng biao |
| |
| Abstract: | Let A be an adjacency matrix of strongly regular graph,the linear representation formula of A m about A,identity matrix and all 1's matrix is given,the count formula of walks of length m from i to j in strongly regular graph is obtained,the classification chart of adjacency matrix is given. |
| |
| Keywords: | strongly regular graph primitive matrix adjacency matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
