diameter

providers: ISGCI

Definition: Maximum distance of two vertices that are in the same connected component.

Relations

Other		Relation from	Relation to
acyclic chromatic number	blue■	exclusion	exclusion
admissibility	blue■	exclusion	exclusion
arboricity	blue■	exclusion	exclusion
average degree	blue■	exclusion	exclusion
average distance	red■	exclusion	upper bound
bandwidth	cyan■	unknown to HOPS	exclusion
bipartite	blue■	unbounded	exclusion
bipartite number	green■	upper bound	exclusion
bisection bandwidth	cyan■	unknown to HOPS	exclusion
block	blue■	unbounded	exclusion
book thickness	blue■	exclusion	exclusion
boolean width	blue■	exclusion	exclusion
bounded components	green■	upper bound	exclusion
bounded expansion	blue■	exclusion	avoids
boxicity	blue■	exclusion	exclusion
branch width	blue■	exclusion	exclusion
c-closure	blue■	exclusion	exclusion
carving-width	blue■	exclusion	exclusion
chi-bounded	magenta■	exclusion	unknown to HOPS
chordal	blue■	unbounded	exclusion
chordality	blue■	exclusion	exclusion
chromatic number	blue■	exclusion	exclusion
clique cover number	green■	upper bound	exclusion
clique-tree-width	blue■	exclusion	exclusion
clique-width	blue■	exclusion	exclusion
cluster	green■	upper bound	exclusion
co-cluster	green■	upper bound	exclusion
cograph	green■	upper bound	exclusion
complete	green■	upper bound	exclusion
connected	blue■	exclusion	avoids
contraction complexity	blue■	exclusion	exclusion
cutwidth	blue■	exclusion	exclusion
cycle	cyan■	unknown to HOPS	exclusion
cycles	cyan■	unknown to HOPS	exclusion
d-admissibility	magenta■	exclusion	unknown to HOPS
d-path-free	green■	upper bound	exclusion
degeneracy	blue■	exclusion	exclusion
degree treewidth	blue■	exclusion	exclusion
diameter	yellow■	equal	equal
diameter+max degree	green■	upper bound	exclusion
distance to bipartite	blue■	exclusion	exclusion
distance to block	blue■	exclusion	exclusion
distance to bounded components	green■	upper bound	exclusion
distance to chordal	blue■	exclusion	exclusion
distance to cluster	green■	upper bound	exclusion
distance to co-cluster	green■	upper bound	exclusion
distance to cograph	green■	upper bound	exclusion
distance to complete	green■	upper bound	exclusion
distance to edgeless	green■	upper bound	exclusion
distance to forest	blue■	exclusion	exclusion
distance to interval	blue■	exclusion	exclusion
distance to linear forest	blue■	exclusion	exclusion
distance to maximum degree	blue■	exclusion	exclusion
distance to outerplanar	blue■	exclusion	exclusion
distance to perfect	blue■	exclusion	exclusion
distance to planar	blue■	exclusion	exclusion
distance to stars	green■	upper bound	exclusion
domatic number	blue■	exclusion	exclusion
domination number	green■	upper bound	exclusion
domino treewidth	blue■	exclusion	exclusion
edge clique cover number	green■	upper bound	exclusion
edge connectivity	blue■	exclusion	exclusion
edge-cut width	blue■	exclusion	exclusion
edge-treewidth	blue■	exclusion	exclusion
edgeless	green■	upper bound	avoids
excluded minor	blue■	exclusion	avoids
excluded planar minor	cyan■	unknown to HOPS	avoids
excluded top-minor	blue■	exclusion	avoids
feedback edge set	blue■	exclusion	exclusion
feedback vertex set	blue■	exclusion	exclusion
flip-width	magenta■	exclusion	unknown to HOPS
forest	blue■	unbounded	exclusion
genus	blue■	exclusion	exclusion
grid	blue■	unbounded	exclusion
h-index	blue■	exclusion	exclusion
interval	blue■	unbounded	exclusion
iterated type partitions	green■	upper bound	exclusion
linear clique-width	blue■	exclusion	exclusion
linear forest	blue■	unbounded	exclusion
linear NLC-width	blue■	exclusion	exclusion
linear rank-width	blue■	exclusion	exclusion
maximum clique	blue■	exclusion	exclusion
maximum degree	blue■	exclusion	exclusion
maximum independent set	green■	upper bound	exclusion
maximum induced matching	lime■	upper bound	unknown to HOPS
maximum leaf number	cyan■	unknown to HOPS	exclusion
maximum matching	green■	upper bound	exclusion
maximum matching on bipartite graphs	green■	upper bound	exclusion
merge-width	magenta■	exclusion	unknown to HOPS
mim-width	magenta■	exclusion	unknown to HOPS
minimum degree	blue■	exclusion	exclusion
mm-width	blue■	exclusion	exclusion
modular-width	green■	upper bound	exclusion
module-width	blue■	exclusion	exclusion
monadically dependent	magenta■	exclusion	unknown to HOPS
monadically stable	magenta■	exclusion	unknown to HOPS
neighborhood diversity	green■	upper bound	exclusion
NLC-width	blue■	exclusion	exclusion
NLCT-width	blue■	exclusion	exclusion
nowhere dense	magenta■	exclusion	unknown to HOPS
odd cycle transversal	blue■	exclusion	exclusion
outerplanar	cyan■	unknown to HOPS	exclusion
overlap treewidth	blue■	exclusion	exclusion
path	blue■	unbounded	exclusion
pathwidth	blue■	exclusion	exclusion
pathwidth+maxdegree	blue■	exclusion	exclusion
perfect	blue■	unbounded	exclusion
planar	blue■	unbounded	exclusion
radius-inf flip-width	blue■	exclusion	exclusion
radius-r flip-width	magenta■	exclusion	unknown to HOPS
rank-width	blue■	exclusion	exclusion
series-parallel	gray■	unknown to HOPS	unknown to HOPS
shrub-depth	cyan■	unknown to HOPS	exclusion
sim-width	magenta■	exclusion	unknown to HOPS
size	green■	upper bound	exclusion
slim tree-cut width	blue■	exclusion	exclusion
sparse twin-width	blue■	exclusion	exclusion
star	green■	upper bound	exclusion
stars	green■	upper bound	exclusion
strong coloring number	blue■	exclusion	exclusion
strong d-coloring number	magenta■	exclusion	unknown to HOPS
strong inf-coloring number	blue■	exclusion	exclusion
topological bandwidth	cyan■	unknown to HOPS	exclusion
tree	blue■	unbounded	exclusion
tree-cut width	blue■	exclusion	exclusion
tree-independence number	magenta■	exclusion	unknown to HOPS
tree-partition-width	blue■	exclusion	exclusion
treebandwidth	blue■	exclusion	exclusion
treedepth	green■	upper bound	exclusion
treelength	orange■	unknown to HOPS	upper bound
treespan	blue■	exclusion	exclusion
treewidth	blue■	exclusion	exclusion
twin-cover number	green■	upper bound	exclusion
twin-width	blue■	exclusion	exclusion
vertex connectivity	gray■	unknown to HOPS	unknown to HOPS
vertex cover	green■	upper bound	exclusion
vertex integrity	green■	upper bound	exclusion
weak coloring number	blue■	exclusion	exclusion
weak d-coloring number	magenta■	exclusion	unknown to HOPS
weak inf-coloring number	green■	upper bound	exclusion
weakly sparse	magenta■	exclusion	unknown to HOPS
weakly sparse and merge width	blue■	exclusion	exclusion

Results

2022 Expanding the Graph Parameter Hierarchy by Tran
- page 25 : modular-width upper bounds diameter by a computable function – Theorem 4.7. Modular-width strictly upper bounds Max Diameter of Components.
- page 25 : graph classes with bounded diameter are not bounded modular-width – Theorem 4.7. Modular-width strictly upper bounds Max Diameter of Components.
Comparing Graph Parameters by Schröder
- page 11 : treedepth upper bounds diameter by an exponential function – Proposition 3.1
assumed
- diameter+max degree upper bounds diameter by a linear function – by definition
- diameter upper bounds average distance by a linear function – By definition
- diameter upper bounds treelength by a linear function – By definition
- diameter is equivalent to diameter – assumed
unknown source
- domination number upper bounds diameter by a linear function – An unbounded diameter implies a long path where no vertices that are more than $3$ apart may be dominated by the same dominating vertex, otherwise we could shorten the path. Hence, the number of dominating vertices is also unbounded.
- distance to cograph upper bounds diameter by a linear function
- graph classes with bounded average distance are not bounded diameter – join of a path and a complete bipartite graph
- maximum induced matching upper bounds diameter by a linear function – Diameter requires an induced path on $d$ edges, hence, maximum induced matching is at least $\lfloor (d+1)/3 \rfloor$.
- modular-width upper bounds diameter by a computable function
- graph class path is not constant diameter – trivially