Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
