Add to ORKGA 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
AbstractWe give a classification of graphs by two parameters s and t such that a graph is regular if...
AbstractKrishnamoorthy et al. [Minimum order graphs with specified diameter, connectivity and regula...
A graph is walk-regular if the number of cycles of length rooted at a given vertex is a constant ...
A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively ad...
A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively ad...
Throughout this paper, by a graph we mean a finite, simple, connected, undirected graph G(V,E). For ...
A (k,t)-regular set is a vertex subset S inducing a k-regular subgraph such that every vertex out of...
A graph G is called (r, 2, r(r − 1))-regular if each vertex in the graph G is at a distance one away...
AbstractAn interval-regular graph is a connected graph in which, for any two vertices u and v, the n...
AbstractOne way to generalize the concept of degree in a graph is to consider the neighborhood N(S) ...
Complex networks have seen much interest from all research fields and have found many potential appl...
A graph G is a (t,r)-regular graph if every collection of t independent vertices is collectively adj...
A (k,τ)-regular set in a graph is a subset of vertices inducing a k-regular subgraph and such that e...
In this paper, we consider only finite, simple, connected graphs. For basic definitions and terminol...
A t-walk-regular graph is a graph for which the number of walks of given length between two vertices...
AbstractWe give a classification of graphs by two parameters s and t such that a graph is regular if...
AbstractKrishnamoorthy et al. [Minimum order graphs with specified diameter, connectivity and regula...
A graph is walk-regular if the number of cycles of length rooted at a given vertex is a constant ...
A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively ad...
A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively ad...
Throughout this paper, by a graph we mean a finite, simple, connected, undirected graph G(V,E). For ...
A (k,t)-regular set is a vertex subset S inducing a k-regular subgraph such that every vertex out of...
A graph G is called (r, 2, r(r − 1))-regular if each vertex in the graph G is at a distance one away...
AbstractAn interval-regular graph is a connected graph in which, for any two vertices u and v, the n...
AbstractOne way to generalize the concept of degree in a graph is to consider the neighborhood N(S) ...
Complex networks have seen much interest from all research fields and have found many potential appl...
A graph G is a (t,r)-regular graph if every collection of t independent vertices is collectively adj...
A (k,τ)-regular set in a graph is a subset of vertices inducing a k-regular subgraph and such that e...
In this paper, we consider only finite, simple, connected graphs. For basic definitions and terminol...
A t-walk-regular graph is a graph for which the number of walks of given length between two vertices...
AbstractWe give a classification of graphs by two parameters s and t such that a graph is regular if...
AbstractKrishnamoorthy et al. [Minimum order graphs with specified diameter, connectivity and regula...
A graph is walk-regular if the number of cycles of length rooted at a given vertex is a constant ...