PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Distance-residual subgraphs
Primož Lukšic and Tomaž Pisanski
Discrete math. pp. 1653-1660, 2010. ISSN 0012-365X


For a connected finite graph G and a subset V0 of its vertex set, a distance-residual subgraph is a subgraph induced on the set of vertices at the maximal distance from V0. Some properties and examples of distance-residual subgraphs of vertex-transitive, edge-transitive, bipartite and semisymmetric graphs are presented. The relations between the distance-residual subgraphs of product graphs and their factors are explored.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:8255
Deposited By:Boris Horvat
Deposited On:21 February 2012