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

• Mathematics • Previous Articles     Next Articles

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

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

WeChat e-book chaoxing Mobile QQ