Authors: Dr. N.R.Santhi Maheswari, L.Subhalakshmi
Abstract: A graph G is (2, r2(r − 1))-support regular, if the 2-support of every vertex is r2(r − 1), where r is the number of vertices at distance one and r(r − 1) is the number of vertices at distance 2 for every vertex. This paper deals with the concept that, for r > 1, a r-regular graph of girth ≥ 5 is (2, r2(r − 1)) support regular. The (2, r(r − 1)2) support regular graph’s existence is also proved and illustrated. Construction of such graphs is also given with some of its properties
