For 1- or 2-regular graphs, the answer to Erdős and Sauer’s problem was established long before 1975. That’s because these objects are very simple. A 1-regular graph can consist of two nodes and a ...

This section is devoted to constructing the cyclic orthogonal double covers (CODCs) of circulant graphs by different classes of graphs, complete bipartite graph as in Section 2.1, the union of the ...

A distributed line (DL) graph is a directed graph based on a regular graph. It enables to construct overlay networks, from a regular graph as an initial graph, by considering node splitting and node ...