Sentence examples for regular graphs from inspiring English sources

Some of the presented strongly regular graphs are new.

We survey results concerning star complements in finite regular graphs, and note the connection with designs and strongly regular graphs in certain cases.

In the case of three regular graphs our results imply an approximation ratio of 0.834.

In this paper, we propose two construction schemes for cubic hamiltonian 1-node-hamiltonian regular graphs.

Bounds on adaptive identifying codes are given for regular graphs and torii in the square grid.

As a result, a few new infinite series of directed strongly regular graphs are constructed.

These graphs are the bipartite distance-regular graphs of diameter 3, and the bipartite, antipodal distance-regular graphs of diameter 4, respectively.

Moreover, pooling designs associated with other special distance-regular graphs are also considered.

In this paper, we will generalize this result to 2-walk-regular graphs.

Let G v,δ) be the set of all δ-regular graphs on v vertices.

In this paper we characterize distance-regular graphs with diameter three having exactly three distinct distance eigenvalues, and also bipartite distance-regular graphs with diameter four having three distinct distance eigenvalues.