Distance-residual graphs

Primoz Luksic; Tomaz Pisanski

Distance-residual graphs

Combinatorics 2007-05-23 v1

Authors: Primoz Luksic , Tomaz Pisanski

Abstract

If we are given a connected finite graph $G$ and a subset of its vertices $V_{0}$ , we define a distance-residual graph as a graph induced on the set of vertices that have the maximal distance from $V_{0}$ . Some properties and examples of distance-residual graphs of vertex-transitive, edge-transitive, bipartite and semisymmetric graphs are shown. The relations between the distance-residual graphs of product graphs and their factors are shown.

Keywords

graph theory random graphs distance sets

Cite

@article{arxiv.math/0609810,
  title  = {Distance-residual graphs},
  author = {Primoz Luksic and Tomaz Pisanski},
  journal= {arXiv preprint arXiv:math/0609810},
  year   = {2007}
}

Comments

14 pages, 4 figures

Related papers

View all related →