Network Properties of (T,R)-Regular Graphs for Small T
A graph is (t, r)-regular if the neighborhood cardinality of every independent vertex set of order t is exactly r. In this paper we investigate the small world properties of (t, r)-regular graphs, namely the characteristic path length and the clustering coefficient when t = 2 and we present an algorithm for constructing (3, r)-regular graphs.
Knisley, Debra; Knisley, Jeff; and Williams, Duran. 2008. Network Properties of (T,R)-Regular Graphs for Small T. International Conference on Theoretical and Mathematical Foundations of Computer Science 2008, TMFCS 2008. 54-58. ISBN: 9781615677207