# diameter

The diameter of a connected graph^{} (or multigraph^{} or pseudograph^{}) is the largest distance that occurs in it.

Here distance, between two nodes (vertices), refers to the length of the shortest path between them.

In disconnected graphs the diameter is undefined (sometimes it is said to be infinite).

Title | diameter |
---|---|

Canonical name | Diameter12 |

Date of creation | 2013-03-22 15:11:24 |

Last modified on | 2013-03-22 15:11:24 |

Owner | marijke (8873) |

Last modified by | marijke (8873) |

Numerical id | 7 |

Author | marijke (8873) |

Entry type | Definition |

Classification | msc 05C12 |

Related topic | Graph |

Related topic | ClosedPath |

Related topic | DistanceInAGraph |