Downloads provided by UsageCounts
From two graphs $G_1$ and $G_2$ on $N_1$ and $N_2$ vertices respectively, the compound graph $G_1[G_2]$ on $N_1N_2$ vertices is obtained connecting $N_2$ copies of $G_1$ following the structure of $G_2$. 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 $\Delta$ and diameter $D$.
Peer Reviewed
Graph theory, Grafs, Problema (Delta, Teoria de, Grafs, Teoria de, Classificació AMS::05 Combinatorics::05C Graph theory, Grafos compuestos, D), :05 Combinatorics::05C Graph theory [Classificació AMS], Problema (Delta, D)
Graph theory, Grafs, Problema (Delta, Teoria de, Grafs, Teoria de, Classificació AMS::05 Combinatorics::05C Graph theory, Grafos compuestos, D), :05 Combinatorics::05C Graph theory [Classificació AMS], Problema (Delta, D)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 45 | |
| downloads | 178 |

Views provided by UsageCounts
Downloads provided by UsageCounts