Add to ORKGAny connected plane nearest neighbor graph has diameter Ω(n^1/6). This bound generalizes to Ω(n^1/3d) in any dimension d
AbstractWe prove the following theorem. If G is a connected finite graph of order p, and S is a k-su...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
The diameter of an unweighted graph is the maximum pairwise distance among its connected vertices. I...
Any connected plane nearest neighbor graph has diameter Ω(n^1/6). This bound generalizes to Ω(n^1/3d...
AbstractLet Γ be a distance regular graph of diameter d and kd the cardinality of vertices at distan...
The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove...
AbstractThe inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. ...
AbstractWe prove that for every connected 4-colourable graph G of order n and minimum degree δ≥1, di...
We prove the following theorem. If G is a connected finite graph of order p, and S is a k-subset of ...
AbstractLet G be a connected graph of order p and S a nonempty set of vertices of G. Then the Steine...
AbstractWe define a graph associated with a group G by letting nontrivial degrees be the vertices, a...
AbstractLet D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of...
Abstract: A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex ...
AbstractIn this paper we study the sequence (ci)0≤i≤d for a distance-regular graph. In particular we...
A diameter graph in is a graph whose set of vertices is a finite subset of and whose set of edges is...
AbstractWe prove the following theorem. If G is a connected finite graph of order p, and S is a k-su...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
The diameter of an unweighted graph is the maximum pairwise distance among its connected vertices. I...
Any connected plane nearest neighbor graph has diameter Ω(n^1/6). This bound generalizes to Ω(n^1/3d...
AbstractLet Γ be a distance regular graph of diameter d and kd the cardinality of vertices at distan...
The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove...
AbstractThe inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. ...
AbstractWe prove that for every connected 4-colourable graph G of order n and minimum degree δ≥1, di...
We prove the following theorem. If G is a connected finite graph of order p, and S is a k-subset of ...
AbstractLet G be a connected graph of order p and S a nonempty set of vertices of G. Then the Steine...
AbstractWe define a graph associated with a group G by letting nontrivial degrees be the vertices, a...
AbstractLet D be a strongly connected oriented graph, i.e., a digraph with no cycles of length 2, of...
Abstract: A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex ...
AbstractIn this paper we study the sequence (ci)0≤i≤d for a distance-regular graph. In particular we...
A diameter graph in is a graph whose set of vertices is a finite subset of and whose set of edges is...
AbstractWe prove the following theorem. If G is a connected finite graph of order p, and S is a k-su...
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a ...
The diameter of an unweighted graph is the maximum pairwise distance among its connected vertices. I...