强正则图的途径计数和邻接矩阵分类  

The number of walks and classification of adjacency matrix of strongly regular graph

作　　者：扈生彪[1] 

机构地区：[1]青海民族学院应用数学系,青海西宁810007

出　　处：《宝鸡文理学院学报（自然科学版）》2002年第3期165-166,190,共3页Journal of Baoji University of Arts and Sciences(Natural Science Edition)

基　　金：青海省教育厅自然科学基金资助项目 (2 0 0 0 0 8)

摘　　要：强正则图的邻接矩阵 A的方幂 Am可以表示为 A,单位矩阵和全 1矩阵的线性组合 ,进而由该表达式得到强正则图的任意两点之间任意长的途径计数公式 。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.

关 键 词：途径计数 分类 强正则图 本原矩阵 邻接矩阵 奇异矩阵 非奇异矩阵 

分 类 号：O157.5[理学—数学]