Student Work
Distance sequences in graph theory
PúblicoThis 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.
- This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
- Creator
- Publisher
- Identifier
- 02D268M
- Advisor
- Year
- 2002
- Date created
- 2002-01-01
- Resource type
- Major
- Rights statement
Las relaciones
- En Collection:
Elementos
Permanent link to this page: https://digital.wpi.edu/show/1831cp002