AbstractCirculant graphs are characterized here as quotient lattices, which are realized as vertices connected by a knot on a k-dimensional flat torus tessellated by hypercubes or hyperparallelotopes. Via this approach we present geometric interpretations for a bound on the diameter of a circulant graph, derive new bounds for the genus of a class of circulant graphs and establish connections with spherical codes and perfect codes in Lee spaces
A spatial embedding of a graph G is a realization of G into the 3-dimensional Euclidean space R^3. J...
Let G = (V, E) be a connected graph (or hypergraph) and let d(x,y) denote the distance between verti...
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or i...
Circulant graphs are characterized here as quotient lattices, which are realized as vertices connect...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
The Publisher regrets that this article is an accidental duplication of an article that has already ...
International audienceA circulant of order $n$ is a Cayley graph for the cyclic group $\mathbb{Z}_n$...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
Quotients of R2 by translation groups are metric spaces known as flat tori. We start from codes whic...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
AbstractIn this paper we study an interconnection network topology based on the radix representation...
AbstractThe circumference of a graphGis the length of a longest cycle inG. In this paper, we shall s...
We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly re...
The line graph of G, denoted L(G), is the graph with vertex set E(G), where vertices x and y are adj...
The genus graphs have been studied by many authors, but just a few results concerning in special cas...
A spatial embedding of a graph G is a realization of G into the 3-dimensional Euclidean space R^3. J...
Let G = (V, E) be a connected graph (or hypergraph) and let d(x,y) denote the distance between verti...
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or i...
Circulant graphs are characterized here as quotient lattices, which are realized as vertices connect...
Circulant graphs are homogeneous graphs with special properties which have been used to build interc...
The Publisher regrets that this article is an accidental duplication of an article that has already ...
International audienceA circulant of order $n$ is a Cayley graph for the cyclic group $\mathbb{Z}_n$...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
Quotients of R2 by translation groups are metric spaces known as flat tori. We start from codes whic...
In this paper, we will investigate graphs that arise from the intersections of geodesics embedded on...
AbstractIn this paper we study an interconnection network topology based on the radix representation...
AbstractThe circumference of a graphGis the length of a longest cycle inG. In this paper, we shall s...
We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly re...
The line graph of G, denoted L(G), is the graph with vertex set E(G), where vertices x and y are adj...
The genus graphs have been studied by many authors, but just a few results concerning in special cas...
A spatial embedding of a graph G is a realization of G into the 3-dimensional Euclidean space R^3. J...
Let G = (V, E) be a connected graph (or hypergraph) and let d(x,y) denote the distance between verti...
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or i...