# simple path

A *simple path* in a graph is a path $P={v}_{0}{e}_{0}{v}_{1}\mathrm{\dots}{e}_{n-1}{v}_{n}$
such that no vertex occurs twice in $P$.
Some authors relax this condition by permitting ${v}_{0}={v}_{n}$. In this case the path is usually called a cycle.

Title | simple path |
---|---|

Canonical name | SimplePath |

Date of creation | 2013-03-22 12:30:42 |

Last modified on | 2013-03-22 12:30:42 |

Owner | mps (409) |

Last modified by | mps (409) |

Numerical id | 6 |

Author | mps (409) |

Entry type | Definition |

Classification | msc 05C38 |

Related topic | Path |

Related topic | Cycle |

Related topic | Graph |

Related topic | PathConnected |