g
graph diameter
Longest distance between two vertices in a graph
Also known as diameter · diameter of a graph · diam(G)
- Instance of
- Subclass of
Overview
All data
23 statements · 26% with external sources · numbers in brackets are citations
- Greater than
- average eccentricity criterion used: greater than or equal to
- Less than
- graph radius criterion used: upper-bounded by a function of · defining formula:
\operatorname{diam}\le2\operatorname{rad}1
- number of distinct eigenvalues criterion used: less than
2
Sources- 1.Stated in Distance in Graphs
- 2.Stated in Sparse topologies with small spectrum size
- minimum rank of a graph criterion used: less than or equal to
1
- detour order criterion used: less than
1
- Grundy domination number criterion used: less than or equal to
1
- graph radius criterion used: upper-bounded by a function of · defining formula:
- Defining formula
\operatorname{diam}(G) = \max_{v\in V}e_G(v)
- In defining formula
\operatorname{diam}(G)symbol represents: graph diameterVsymbol represents: vertex sete_Gsymbol represents: graph eccentricity
On other databases
4 identifiers linking graph diameter across the web's reference databases