| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649240 | Discrete Mathematics | 2010 | 8 Pages |
Abstract
For a connected finite graph GG and a subset V0V0 of its vertex set, a distance-residual subgraph is a subgraph induced on the set of vertices at the maximal distance from V0V0. 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Primož Lukšič, Tomaž Pisanski,