Elsevier

Discrete Mathematics

Volume 257, Issue 1, 6 November 2002, Pages 101-109
Discrete Mathematics

On spectral bounds for cutsets

https://doi.org/10.1016/S0012-365X(01)00473-3Get rights and content
Under an Elsevier user license
open archive

Abstract

Let Γ be a simple and connected graph. A k-vertex separator [k-edge separator] is a subset of vertices [edges] whose deletion separates the vertex [edge] set of Γ into two parts of equal cardinality, that are at distance greater than k in Γ. Here we investigate the relation between the cardinality of these cutsets and the laplacian spectrum of Γ. As a consequence of the study, we obtain the well-known lower bounds for the bandwidth and the bipartition width of a graph.

Cited by (0)

1

Work supported in part by the Spanish Research Council (Comisión Interministerial de Ciencia y Tecnología, CICYT) under project TIC 97-0963.