Some new large compound graphs

Authors:
C. Delorme;J. Gómez
Affiliations:
LRI, Université Paris-Sud, 91405 Orsay Cedex, France;Universitat Politècnica de Catalunya, Barcelona, Spain
Venue:
European Journal of Combinatorics
Year:
2002

Citing 5
Cited 0

Graphs & digraphs (2nd ed.)

Graphs & digraphs (2nd ed.)
Strategies for interconnection networks: some methods from graph theory

Journal of Parallel and Distributed Computing
Examples of products giving large graphs with given degree and diameter

Discrete Applied Mathematics - Special double volume: interconnection networks
Graphs on alphabets as models for large interconnection networks

Discrete Applied Mathematics - Special double volume: interconnection networks
On large (&Dgr;,D)-graphs

Discrete Mathematics - Special issue on combinatorics and algorithms

Quantified Score

Hi-index	0.00

Visualization

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.