Bounds on separated pairs of subgraphs, eigenvalues and related polynomials

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.

MoreLess

Year of publication:	1995
Authors:	van Dam, Edwin Robert
Institutions:	Tilburg University, School of Economics and Management
Subject:	Graphs \| Eigenvalues \| Polynomials \| mathematics

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Research Memorandum.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series Research memorandum / Tilburg University, Faculty of Economics and Business Administration Number FEW 699
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011086745