Distance-residual graphs

Details Distance-residual graphs Distance-residual graphs

2006-09-28

arxiv.org/abs/math/0609810v1

Mathematics

Combinatorics

14 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Distance-residual graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distance-residual graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance-residual graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532326