强正则图的字典积的零度和秩  

The Nullity and Ranks of the Lexicographic Product of Strongly Regular Graphs

作　　者：周后卿[1] 

机构地区：[1]邵阳学院数学系,湖南邵阳422000

出　　处：《内蒙古师范大学学报（自然科学汉文版）》2007年第5期576-579,共4页Journal of Inner Mongolia Normal University(Natural Science Edition)

基　　金：湖南省教育厅科研基金项目(06C755);邵阳市科技计划项目(53J07)

摘　　要：设G,H是两个强正则图,它们的字典积(lexicographic product)图的零度和秩是指它们的邻接矩阵的零度和秩.讨论了部分强正则图在二元运算下的字典积图的结构、零度及秩,得到了一些有意义的结果.Let G,H be two strongly regular graphs,the nullity and ranks that of their adjacency matrix. Struc operation-lexicographic product was ture, nullity and discussed,and s rank of strongly regular of the graph G ＊ H refer to graphs under certain binary ome meaningful results were obtained in this paper.

关 键 词：强正则图 字典积 零度 秩 

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