## Abstract

A family of expanding graphs is useful to make many kind of networks efficient, as Ajtai et al. constructed sorting networks of depth O(log n) with it. On the other hand, Klawe showed that particular families of directed graphs obtained from a finite number of one-dimensional linear functions, which play important roles in constructing some kind of networks or generating random numbers, cannot be families of expanding graphs. Moreover, Klawe gave a conjecture concerning a lower bound of the amount of expanding property of these families. Maass gave a partial answer to the conjecture. In this paper, a theorem that states the relationship between the diameter and the size of a boundary in a directed graph is proved. An answer to Klawe's conjecture is also obtained from this theorem. The answer is more suitable than Maass's one.

Original language | English |
---|---|

Pages (from-to) | 277-282 |

Number of pages | 6 |

Journal | Information Processing Letters |

Volume | 50 |

Issue number | 5 |

DOIs | |

Publication status | Published - Jun 10 1994 |

Externally published | Yes |

## Keywords

- Boundaries
- Combinatorial problems
- Diameter
- Expanding graphs
- Linear functions

## ASJC Scopus subject areas

- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications