Affordable Access

Publisher Website

Laplacian Eigenvalues and multisections

Authors
Journal
Electronic Notes in Discrete Mathematics
1571-0653
Publisher
Elsevier
Publication Date
Volume
5
Identifiers
DOI: 10.1016/s1571-0653(05)80134-9
Keywords
  • Eigenvalues
  • Partitions
  • Max-Cut
  • Chromatic Number

Abstract

Abstract We will describe how simple computations on the eigenvalues of the laplacian matrix of a graph and a certain Gram matrix provide bounds on the number of edges joining parts in a graph where the vertex set is separated in parts of given sizes. These bounds are compared to existing ones.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments