Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T02:02:50.501Z 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, Spainfiol@mat.upc.es
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

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