PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (236)
Orphanage
Unclass'd (1)
Unproven (540)
Corrections (51)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Copyright
About
Owner confidence rating: Very low Entry average rating: No information on entry rating
diameter (Definition)

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).



"diameter" is owned by marijke.
(view preamble | get metadata)

View style:

See Also: graph, (closed) walk / trek / trail / path, distance (in a graph)

Keywords:  graph, distance
Log in to rate this entry.
(view current ratings)

Cross-references: infinite, graphs, path, vertices, occur ins, distance, pseudograph, multigraph, connected graph
There are 7 references to this entry.

This is version 4 of diameter, born on 2005-04-11, modified 2005-04-11.
Object id is 6946, canonical name is Diameter3.
Accessed 2076 times total.

Classification:
AMS MSC: 05C12 (Combinatorics :: Graph theory :: Distance in graphs)
Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)