Distance-residual graphs

Simple item page
dc.creatorLuksic, Primoz
dc.creatorPisanski, Tomaz
dc.date2006-09-28
dc.date.accessioned2026-07-07T07:25:24Z
dc.date.available2026-07-07T07:25:24Z
dc.descriptionIf 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.
dc.description14 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/0609810
dc.identifierhttp://arxiv.org/abs/math/0609810
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116704
dc.subjectCombinatorics
dc.subject05C12
dc.titleDistance-residual graphs
dc.typetext

Files

Collections

arXiv