AbstractWe study the k-diameter of k-regular k-connected graphs. Among other results, we show that every k-regular k-connected graph on n vertices has k-diameter at most n/2 and this upper bound cannot be improved when n=4k−6+i(2k−4). In particular, the maximal 3-diameter of 3-regular graphs with 2n vertices is equal to n
For $n\in \mathbb{N}$ and $D\subseteq \mathbb{N}$, the distance graph $P_n^D$ has vertex set $\{ 0,1...
AbstractLet D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
AbstractWe study the k-diameter of k-regular k-connected graphs. Among other results, we show that e...
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
A simple undirected connected graph with minimum degree K is said to be K-restrained. Thus the class...
AbstractWe study connection networks in which certain pairs of nodes have to be connected by k edge-...
AbstractKrishnamoorthy et al. [Minimum order graphs with specified diameter, connectivity and regula...
AbstractA diameter-bound theorem for a class of distance-regular graphs which includes all those wit...
AbstractThe (s,m)-radius ρs,m(G) is an important parameter associated with a message transmission ne...
AbstractIn 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has ...
Abstract. We introduce the concept of (k, l)-radius of a graph and prove that for any fixed pair k, ...
AbstractLet G be a connected graph of order p and S a nonempty set of vertices of G. Then the Steine...
AbstractIn this paper we study the sequence (ci)0≤i≤d for a distance-regular graph. In particular we...
AbstractLet f(t, D) denote the maximum possible diameter of a graph obtained from a (t+1)-edge-conne...
For $n\in \mathbb{N}$ and $D\subseteq \mathbb{N}$, the distance graph $P_n^D$ has vertex set $\{ 0,1...
AbstractLet D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
AbstractWe study the k-diameter of k-regular k-connected graphs. Among other results, we show that e...
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
A simple undirected connected graph with minimum degree K is said to be K-restrained. Thus the class...
AbstractWe study connection networks in which certain pairs of nodes have to be connected by k edge-...
AbstractKrishnamoorthy et al. [Minimum order graphs with specified diameter, connectivity and regula...
AbstractA diameter-bound theorem for a class of distance-regular graphs which includes all those wit...
AbstractThe (s,m)-radius ρs,m(G) is an important parameter associated with a message transmission ne...
AbstractIn 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has ...
Abstract. We introduce the concept of (k, l)-radius of a graph and prove that for any fixed pair k, ...
AbstractLet G be a connected graph of order p and S a nonempty set of vertices of G. Then the Steine...
AbstractIn this paper we study the sequence (ci)0≤i≤d for a distance-regular graph. In particular we...
AbstractLet f(t, D) denote the maximum possible diameter of a graph obtained from a (t+1)-edge-conne...
For $n\in \mathbb{N}$ and $D\subseteq \mathbb{N}$, the distance graph $P_n^D$ has vertex set $\{ 0,1...
AbstractLet D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
DOI
Add to ORKG