AbstractThe radius and diameter of a graph are known to satisfy the relation rad G ≤ diam G ≤ 2 rad G. We show that this is the only restriction on these parameters and construct all non-isomorphic graphs of minimal order having a specified radius and diameter
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
summary:We define digraphs minimal, critical, and maximal by three types of radii. Some of these cla...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
Abstract. Let G be a graph of radius r and diameter d with d ≤ 2r − 2. We show that G contains a cyc...
AbstractWe give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a conne...
summary:The known relation between the standard radius and diameter holds for graphs, but not for di...
AbstractA (d, c, v)-graph G is one which is regular of degree v and has diameter d and connectivity ...
AbstractIn 1986 Peyrat, Rall and Slater established a characterization of graphs G for which the dia...
summary:The diameter of a graph $G$ is the maximal distance between two vertices of $G$. A graph $G$...
AbstractThis paper develops some properties of simple blocks—block graphs which are determined up to...
summary:The eccentricity $e(v)$ of a vertex $v$ is defined as the distance to a farthest vertex from...
For positive integers d, c and v, the minimum number of nodes for a c-connected v-regular graph of d...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractWe prove sharp bounds concerning domination number, radius, order and minimum degree of a gr...
Abstract. We introduce the concept of (k, l)-radius of a graph and prove that for any fixed pair k, ...
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
summary:We define digraphs minimal, critical, and maximal by three types of radii. Some of these cla...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
Abstract. Let G be a graph of radius r and diameter d with d ≤ 2r − 2. We show that G contains a cyc...
AbstractWe give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a conne...
summary:The known relation between the standard radius and diameter holds for graphs, but not for di...
AbstractA (d, c, v)-graph G is one which is regular of degree v and has diameter d and connectivity ...
AbstractIn 1986 Peyrat, Rall and Slater established a characterization of graphs G for which the dia...
summary:The diameter of a graph $G$ is the maximal distance between two vertices of $G$. A graph $G$...
AbstractThis paper develops some properties of simple blocks—block graphs which are determined up to...
summary:The eccentricity $e(v)$ of a vertex $v$ is defined as the distance to a farthest vertex from...
For positive integers d, c and v, the minimum number of nodes for a c-connected v-regular graph of d...
AbstractWe determine the graphs with maximal spectral radius among the ones on n nodes with diameter...
AbstractWe prove sharp bounds concerning domination number, radius, order and minimum degree of a gr...
Abstract. We introduce the concept of (k, l)-radius of a graph and prove that for any fixed pair k, ...
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
summary:We define digraphs minimal, critical, and maximal by three types of radii. Some of these cla...
AbstractA diameter critical graph has the property that the addition of any edge decreases the diame...
DOI
Add to ORKG