Add to ORKGThe degree-diameter problem asks for the maximum number of vertices in a graph with maximum degree ∆ and diameter k. For fixed k, the answer i
The (A ,D) (degree/diameter) problem consists of finding the largest possible number of vertices n a...
AbstractLet G be a simple graph of order n without isolated vertices. If the integer h satisfies h ⩾...
The degree diameter problem explores the biggest graph (in terms of number of nodes) subject to some...
The degree-diameter problem asks for the maximum number of vertices in agraph with maximum degree an...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. T...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
The degree diameter problem involves finding the largest graph (in terms of number of vertices) subj...
Given a fixed diameter and maximum degree, the degree/diameter problem involves finding the maximum ...
AbstractWe offer the exact solution of the degree–diameter problem for planar graphs in the case of ...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree diameter problem involves finding the largest graph (in terms of the number of vertices) ...
This paper discusses the most popular algebraic techniques and computational methods that have been...
The (A ,D) (degree/diameter) problem consists of finding the largest possible number of vertices n a...
AbstractLet G be a simple graph of order n without isolated vertices. If the integer h satisfies h ⩾...
The degree diameter problem explores the biggest graph (in terms of number of nodes) subject to some...
The degree-diameter problem asks for the maximum number of vertices in agraph with maximum degree an...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. T...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
The degree diameter problem involves finding the largest graph (in terms of number of vertices) subj...
Given a fixed diameter and maximum degree, the degree/diameter problem involves finding the maximum ...
AbstractWe offer the exact solution of the degree–diameter problem for planar graphs in the case of ...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
The degree diameter problem involves finding the largest graph (in terms of the number of vertices) ...
This paper discusses the most popular algebraic techniques and computational methods that have been...
The (A ,D) (degree/diameter) problem consists of finding the largest possible number of vertices n a...
AbstractLet G be a simple graph of order n without isolated vertices. If the integer h satisfies h ⩾...
The degree diameter problem explores the biggest graph (in terms of number of nodes) subject to some...