From two graphs G1 and G2 on N1 and N2 vertices respectively, the compound graph G1[G2] on N1N2 vertices is obtained by connecting in some way N2 copies of G1.
We present in this paper methods of compounding that result in families of graphs with large number of vertices for given values of the maximum degree ∆ and diameter D.
@article{urn:eudml:doc:38891,
title = {Algunos grafos compuestos.},
journal = {Stochastica},
volume = {7},
year = {1983},
pages = {137-143},
zbl = {0561.05050},
mrnumber = {MR0766696},
language = {es},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:38891}
}
Fiol Mora, Miguel Angel; Fàbrega Canudas, Josep. Algunos grafos compuestos.. Stochastica, Tome 7 (1983) pp. 137-143. http://gdmltest.u-ga.fr/item/urn:eudml:doc:38891/