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 Ｃｍ，Ｋｎ and strongly regular graphs,for example,cocktail party graph,ＣＰ（ｋ）；a special class of Kneser graphs,ＫＷ2 and Johnson graphs：Ｃｍ，Ｋｎ　Ｊ（Ｗ，2，１） with the method of matrix theory,the authors obtain some conclusions.

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