Faculty Advisor

Christopher, Peter R.

Abstract

This project investigates problems involving the concept of distance in graph theory. Applications of these problems exist in such areas as optimizing facility locations. Defining the status of a vertex as the sum of the distances to all other vertices in a graph, we explore certain variations of this parameter, such as total status, minimum average distance and minimum and maximum chromatic status. We compute these parameters for various families of graphs, and obtain bounds for more general results.

Publisher

Worcester Polytechnic Institute

Date Accepted

January 2002

Major

Mathematical Sciences

Project Type

Major Qualifying Project

Accessibility

Restricted-WPI community only

Advisor Department

Mathematical Sciences

Share

COinS