journal6 ›› 2007, Vol. 28 ›› Issue (1): 30-33.

• 数学 • 上一篇    下一篇

正则图的强积的秩

  

  1. (邵阳学院数学系,湖南 邵阳 422000)
  • 出版日期:2007-01-25 发布日期:2012-06-19
  • 作者简介:周后卿(1963-),男,湖南新邵人,邵阳学院数学系副教授,硕士,主要从事代数图论研究.
  • 基金资助:

    湖南省教育厅科学研究项目(06C755)

Ranks of Strong Product of Regular Graphs

  1. (Department of Mathematics,Shaoyang University,Shaoyang 422000,Hunan China)
  • Online:2007-01-25 Published:2012-06-19

摘要:设G,H是2个正则图或强正则图,那么G,H的强积图的秩就是它们的邻接矩阵的秩.运用矩阵理论的方法,研究正则图Cm,Kn以及强正则图如鸡尾酒会图CP(k),Kneser图KW2,Johnson图J(w,2,1)的强积图的秩,得到了许多结果.

关键词: 正则图, 强正则图, 强积,

Abstract: Let G,H be regular graphs and strongly regular graphs,then the rank of strong product graphs is the rank of the  adjacency matrix.The authors consider regular graphs as Cm,Kn and strongly regular graphs,for example,cocktail party graph,CP(k);a special class of Kneser graphs,KW2 and Johnson graphs:Cm,Kn J(W,2,1) with the method of matrix theory,the authors obtain some conclusions.

Key words: regular graph, strongly regular graphs, strong product, rank

公众号 电子书橱 超星期刊 手机浏览 在线QQ