Add to ORKGFor $n\in \mathbb{N}$ and $D\subseteq \mathbb{N}$, the distance graph $P_n^D$ has vertex set $\{ 0,1,\ldots,n-1\}$ and edge set $\{ ij\mid 0\leq i,j\leq n-1, |j-i|\in D\}$. The class of distance graphs generalizes the important and very well-studied class of circulant graphs which have been proposed for numerous network applications. In view of fault tolerance and delay issues in these applications, the connectivity and diameter of circulant graphs have been studied in great detail. Our main contributions are hardness results concerning computational problems related to the connectivity and diameter of distance graphs and a number-theoretic characterization of the connected distance graphs $P_n^D$ for $|D|=2$
AbstractLet Γ be a distance regular graph of diameter d and kd the cardinality of vertices at distan...
Abstract. A point set X in the plane is called a k-distance set if there are exactly k different dis...
AbstractLet G=(V,E) be a digraph with diameter D≠1. For a given integer 1⩽t⩽D, the t-distance connec...
For $n\in \mathbb{N}$ and $D\subseteq \mathbb{N}$, the distance graph $P_n^D$ has vertex set $\{ 0,1...
Abstract. For n ∈ N and D ⊆ N, the distance graph PDn has vertex set {0, 1,..., n − 1} and edge set ...
For $n\in \mathbb{N}$ and $D\subseteq \mathbb{N}$, the distance graph $P_n^D$ has vertex set $\{ 0,1...
For any $k \in \mathbb{N}$, the $k-$distance graph $D^{k}G$ has the same vertex set of $G$, and two ...
AbstractIn this paper we study the sequence (ci)0≤i≤d for a distance-regular graph. In particular we...
In this thesis, we deal with bounds on distance measures, namely, degree distance, radius, diameter...
Graphs and AlgorithmsInternational audienceFor a set D ⊂ Zn, the distance graph Pn(D) has Zn as its ...
Abstract: In this thesis we study and investigate bounds on distance measures in graphs and digraphs...
All graphs considered are undirected finite graphs without loops or multiple edges. Let $\Gamma=(V\G...
AbstractThe average n-distance of a connected graph G, μn(G), is the average of the Steiner distance...
AbstractIn this note, we give a new short proof of the following theorem: Let G be a 2-connected gra...
AbstractA diameter-bound theorem for a class of distance-regular graphs which includes all those wit...
AbstractLet Γ be a distance regular graph of diameter d and kd the cardinality of vertices at distan...
Abstract. A point set X in the plane is called a k-distance set if there are exactly k different dis...
AbstractLet G=(V,E) be a digraph with diameter D≠1. For a given integer 1⩽t⩽D, the t-distance connec...
For $n\in \mathbb{N}$ and $D\subseteq \mathbb{N}$, the distance graph $P_n^D$ has vertex set $\{ 0,1...
Abstract. For n ∈ N and D ⊆ N, the distance graph PDn has vertex set {0, 1,..., n − 1} and edge set ...
For $n\in \mathbb{N}$ and $D\subseteq \mathbb{N}$, the distance graph $P_n^D$ has vertex set $\{ 0,1...
For any $k \in \mathbb{N}$, the $k-$distance graph $D^{k}G$ has the same vertex set of $G$, and two ...
AbstractIn this paper we study the sequence (ci)0≤i≤d for a distance-regular graph. In particular we...
In this thesis, we deal with bounds on distance measures, namely, degree distance, radius, diameter...
Graphs and AlgorithmsInternational audienceFor a set D ⊂ Zn, the distance graph Pn(D) has Zn as its ...
Abstract: In this thesis we study and investigate bounds on distance measures in graphs and digraphs...
All graphs considered are undirected finite graphs without loops or multiple edges. Let $\Gamma=(V\G...
AbstractThe average n-distance of a connected graph G, μn(G), is the average of the Steiner distance...
AbstractIn this note, we give a new short proof of the following theorem: Let G be a 2-connected gra...
AbstractA diameter-bound theorem for a class of distance-regular graphs which includes all those wit...
AbstractLet Γ be a distance regular graph of diameter d and kd the cardinality of vertices at distan...
Abstract. A point set X in the plane is called a k-distance set if there are exactly k different dis...
AbstractLet G=(V,E) be a digraph with diameter D≠1. For a given integer 1⩽t⩽D, the t-distance connec...