The direct expansion of graphs

Citations of this article
Mendeley users who have this article in their library.


The concept of expansion of a graph has proved to be an efficient tool in the study of median, quasi-median and partial Hamming graphs. The basic idea of expansion is that given a graph G, we obtain a graph G′ by enlarging a subgraph of G according to a certain rule in such a way that G′ inherits certain properties of G. Mulder suggested several new rules for such expansions (H. M. Mulder, The expansion procedure for graphs, in: R. Bodendiek (Ed. ), Contemporary Methods in Graph Theory, B. I. -Wissenschaftsverlag, Manhaim, 1990, pp. 459-477). In particular he pointed out the case when a direct product in the process of expansion is used, and called it a relational expansion. In this paper we investigate it in further detail, especially, we deal with preservation of connectivity by this expansion. © 2002 Elsevier Science B. V. All rights reserved.




Brešar, B. (2002). The direct expansion of graphs. Discrete Mathematics, 244(1–3), 17–30.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free