Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-30T15:39:50.213Z Has data issue: false hasContentIssue false
  • English
  • Français

A General Spectral Bound for Distant Vertex Subsets

Published online by Cambridge University Press:  28 January 2003

M. A. FIOL
M. A. FIOL
Affiliation:
Departament de Matemàtica Aplicada i Telemàtica, Universitat Politècnica de Catalunya, Jordi Girona 1-3, Mòdul C3, Campus Nord, 08034 Barcelona, [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

A general spectral bound for the sizes of some vertex subsets, which are mutually at a given minimum distance in a graph, is derived. This unifies and improves some previous results. Some applications to the study of certain metric parameters of the graph are then discussed.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 12 , Issue 1 , January 2003 , pp. 17 - 26
Copyright
2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)