Abstract
AbstractA path system in a graph is a collection of paths with a unique path for every two vertices . We say that is consistent if for any path , every subpath of is also in . It is metrizable if there exists a positive weight function such that is comprised of ‐shortest paths. We call irreducible if there does not exist a partition such that restricts to a path system on both and . In this paper, we construct an infinite family of nonmetrizable irreducible consistent path systems on certain Paley graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
