A treatise on pansophy

Thumbnail Image
Date
2020-01-01
Authors
Wass, Isaac
Major Professor
Advisor
Steve Butler
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Organizational Unit
Journal Issue
Is Version Of
Versions
Series
Department
Mathematics
Abstract

In 2017, Boats and Kikas introduced a new parameter, the pansophy of a graph, which is the expected value of the number of disjointly-routable paths in a graph given a random distribution of ordered starting and stopping points. We present an introduction to the topic and prove several results related to pansophy, including formulas and bounds for the pansophies of different graphs

and graph families, the effect of various graph operations, and some density results. We also discuss the computational aspect of computing the pansophy of a graph.

Comments
Description
Keywords
Citation
Source
Copyright
Fri May 01 00:00:00 UTC 2020