Some New Large Compound Graphs
Source: European Journal of Combinatorics, Volume 23, Number 5, July 2002 , pp. 539-547(9)
Publisher: Academic Press
This paper deals with some new constructions of large (, D) graphs, i.e., graphs with maximum degree and diameter D and many vertices. Most constructions presented here are based on the compound graphs technique. The basic idea of compound graphs consists of connecting together several copies of a given graph according to the structure of another one.
Using a variation on this classical theme, we build some new large graphs and some new large bipartite graphs. We will also apply the method of vertex duplication to improve some entries in the tables of known large bipartite graphs. Copyright 2002 Elsevier Science Ltd.
Document Type: Research article
Publication date: 2002-07-01