Vertex-disjoint routings in star graphs
Conference Paper
Overview
Additional Document Info
View All
Overview
abstract
In this paper we show the necessary and sufficient condition for any two nodes in an n-dimensional star graph to have n - 1 vertex-disjoint paths with length less than or equal to the minimum distance plus 2. We also provide an algorithm to generate these n - 1 vertex-disjoint paths.