Title

Network Properties of (T,R)-Regular Graphs for Small T

Document Type

Conference Proceeding

Publication Date

12-1-2008

Description

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.

This document is currently not available here.

Share

COinS