Thumbnail Image
Item

Bounds on separated pairs of subgraphs, eigenvalues and related polynomials

van Dam,E.R.
Abstract
We give a bound on the sizes of two sets of vertices at a given minimum distance (a separated pair of subgraphs) in a graph in terms of polynomials and the spectrum of the graph. We find properties of the polynomial optimizing the bound. Explicit bounds on the number of vertices at maximal distance and distance two from a given vertex, and on the size of two equally large sets at maximal distance are given, and we find graphs for which the bounds are tight.
Description
Pagination: 10
Date
1995
Journal Title
Journal ISSN
Volume Title
Publisher
Unknown Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Files
Thumbnail Image
699.pdf
Adobe PDF, 78.59 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Graphs, Eigenvalues, Polynomials, mathematics
Citation
van Dam, E R 1995, Bounds on separated pairs of subgraphs, eigenvalues and related polynomials. Research memorandum / Tilburg University, Faculty of Economics and Business Administration, vol. FEW 699, vol. FEW 699, Unknown Publisher.
URI
https://hdl.handle.net/20.500.14602/86623
License
info:eu-repo/semantics/restrictedAccess
Embedded videos