Abstract:We study the problem of finding large graphs with given degree and diameter D = 3; that is, the construction of graphs with number of vertices as large as possible for a given degree and diameter D = 3. There are two general methods to obtain large graphs: computer search and analytic methods. In this article, new ideas are proposed for analytic methods which allow us to improve the values for the entries (12,3), (13,3), and (14,3) in the table of the largest known ( , D)-graphs.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.