Feng, Jinfeng - In: Mathematical Methods of Operations Research 69 (2009) 2, pp. 343-352
Let G = (V, E) be a connected graph. For a vertex subset <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${S\subseteq V}$$</EquationSource> </InlineEquation>, G[S] is the subgraph of G induced by S. A cycle C (a path, respectively) is said to be an induced cycle (path, respectively) if G[V(C)] = C (G[V(P)] = P, respectively). The distance between a vertex x and a...</equationsource></inlineequation>