AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. This problem has been extensively studied both for directed and undirected graphs, ando also for special classes of graphs. In this work we present the state of art of the degree/diameter problem for mixed graphs
A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (t...
This paper discusses the most popular algebraic techniques and computational methods that have been...
This paper discusses the most popular algebraic techniques and computational methods that have been ...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
The Degree/diameter problem asks for the largest graphs given diameter and maximum degree. This prob...
AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. T...
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximu...
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 asks for the maximum number of vertices in agraph with maximum degree an...
Given a fixed diameter and maximum degree, the degree/diameter problem involves finding the maximum ...
The Degree/Diameter Problem is an extremal problem in graph theory with applications in network desi...
The degree/diameter problem for mixed graphs asks for the largest possible order of a mixed graph wi...
A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (t...
This paper discusses the most popular algebraic techniques and computational methods that have been...
This paper discusses the most popular algebraic techniques and computational methods that have been ...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
The Degree/diameter problem asks for the largest graphs given diameter and maximum degree. This prob...
AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. T...
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximu...
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 asks for the maximum number of vertices in agraph with maximum degree an...
Given a fixed diameter and maximum degree, the degree/diameter problem involves finding the maximum ...
The Degree/Diameter Problem is an extremal problem in graph theory with applications in network desi...
The degree/diameter problem for mixed graphs asks for the largest possible order of a mixed graph wi...
A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (t...
This paper discusses the most popular algebraic techniques and computational methods that have been...
This paper discusses the most popular algebraic techniques and computational methods that have been ...
DOI
Add to ORKG