Bermond, Comellas and Hsu gave an excellent survey on multi-loop networks, directed and
undirected, in 1995, but only one and half page is on loop networks other than the directed …

The solution of the problem of organizing optimal communications in circulant networks of
degree four is considered. For a family of optimal circulant networks with the minimum …

Circulant graphs have been extensively investigated over the past 30 years because of their
broad application to different fields of theory and practice. Two known surveys on circulant …

The diameter of a graph measures the maximal distance between any pair of vertices. The
diameters of many small-world networks, as well as a variety of other random graph models …

In this paper we study an interconnection network topology based on the radix
representation of integers and modulo arithmetic. The multiplicative circulant graph MC (r, k) …

We investigate various problems related to circulant graphs—finding the shortest path
between two vertices, finding the shortest loop, and computing the diameter. These …

The obnoxious center problem in a graph G asks for a location on an edge of the graph such
that the minimum weighted distance from this point to a vertex of the graph is as large as …

This article presents software for the synthesis of circulant graphs and the dataset obtained.
An algorithm and new methods, which increase the speed of finding optimal circulant …

An independent broadcast on a graph G is a function f: V→{0,…, diam (G)} such that (i) f
(v)≤ e (v) for every vertex v∈ V (G), where diam (G) denotes the diameter of G and e (v) the …

The diameter of a graph is the maximum distance among all pairs of vertices. Thus a graph $
G $ has diameter $ d $ if any two vertices are at distance at most $ d $ and there are two …