diameter

providers: ISGCI

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


Relations

OtherRelation fromRelation to
acyclic chromatic numberblueexclusionexclusion
arboricityblueexclusionexclusion
average degreeblueexclusionexclusion
average distanceredexclusionupper bound
bandwidthblueexclusionexclusion
bipartiteblueunboundedexclusion
bipartite numberredexclusionupper bound
bisection bandwidthblueexclusionexclusion
blockblueunboundedexclusion
book thicknessblueexclusionexclusion
boolean widthblueexclusionexclusion
bounded componentsgreenupper boundexclusion
boxicityblueexclusionexclusion
branch widthblueexclusionexclusion
c-closureblueexclusionexclusion
carving-widthblueexclusionexclusion
chordalblueunboundedexclusion
chordalityblueexclusionexclusion
chromatic numberblueexclusionexclusion
clique cover numbergreenupper boundexclusion
clique-tree-widthblueexclusionexclusion
clique-widthblueexclusionexclusion
clustergreenupper boundexclusion
co-clustergreenupper boundexclusion
cographgreenupper boundexclusion
completegreenupper boundexclusion
connectedblueunboundedexclusion
contraction complexityblueexclusionexclusion
cutwidthblueexclusionexclusion
cycleblueunboundedexclusion
cyclesblueunboundedexclusion
d-path-freegreenupper boundexclusion
degeneracyblueexclusionexclusion
degree treewidthblueexclusionexclusion
diameteryellowequalequal
diameter+max degreegreenupper boundexclusion
disconnectedcyanunknown to HOPSexclusion
disjoint cyclesblueunboundedexclusion
distance to bipartiteblueexclusionexclusion
distance to blockblueexclusionexclusion
distance to bounded componentsgreenupper boundexclusion
distance to chordalblueexclusionexclusion
distance to clustergreenupper boundexclusion
distance to co-clustergreenupper boundexclusion
distance to cographgreenupper boundexclusion
distance to completegreenupper boundexclusion
distance to disconnectedblueexclusionexclusion
distance to edgelessgreenupper boundexclusion
distance to forestblueexclusionexclusion
distance to intervalblueexclusionexclusion
distance to linear forestblueexclusionexclusion
distance to maximum degreeblueexclusionexclusion
distance to outerplanarblueexclusionexclusion
distance to perfectblueexclusionexclusion
distance to planarblueexclusionexclusion
distance to starsgreenupper boundexclusion
domatic numberblueexclusionexclusion
domination numbergreenupper boundexclusion
edge clique cover numbergreenupper boundexclusion
edge connectivityblueexclusionexclusion
edgelessgreenupper boundexclusion
feedback edge setblueexclusionexclusion
feedback vertex setblueexclusionexclusion
forestblueunboundedexclusion
genusblueexclusionexclusion
girthredexclusionupper bound
gridblueunboundedexclusion
h-indexblueexclusionexclusion
inf-flip-widthblueexclusionexclusion
intervalblueunboundedexclusion
iterated type partitionsgreenupper boundexclusion
linear clique-widthblueexclusionexclusion
linear forestblueunboundedexclusion
linear NLC-widthblueexclusionexclusion
linear rank-widthblueexclusionexclusion
maximum cliqueblueexclusionexclusion
maximum degreeblueexclusionexclusion
maximum independent setgreenupper boundexclusion
maximum induced matchinglimeupper boundunknown to HOPS
maximum leaf numberblueexclusionexclusion
maximum matchinggreenupper boundexclusion
maximum matching on bipartite graphsgreenupper boundexclusion
mim-widthmagentaexclusionunknown to HOPS
minimum degreeblueexclusionexclusion
mm-widthblueexclusionexclusion
modular-widthgreenupper boundexclusion
module-widthblueexclusionexclusion
neighborhood diversitygreenupper boundexclusion
NLC-widthblueexclusionexclusion
NLCT-widthblueexclusionexclusion
odd cycle transversalblueexclusionexclusion
outerplanarblueunboundedexclusion
pathblueunboundedexclusion
pathwidthblueexclusionexclusion
pathwidth+maxdegreeblueexclusionexclusion
perfectblueunboundedexclusion
planarblueunboundedexclusion
radius-r flip-widthmagentaexclusionunknown to HOPS
rank-widthblueexclusionexclusion
shrub-depthcyanunknown to HOPSexclusion
sim-widthmagentaexclusionunknown to HOPS
sizegreenupper boundexclusion
stargreenupper boundexclusion
starsgreenupper boundexclusion
topological bandwidthblueexclusionexclusion
treeblueunboundedexclusion
tree-independence numbermagentaexclusionunknown to HOPS
treedepthgreenupper boundexclusion
treelengthorangeunknown to HOPSupper bound
treewidthblueexclusionexclusion
twin-cover numbergreenupper boundexclusion
twin-widthblueexclusionexclusion
vertex connectivityblueexclusionexclusion
vertex covergreenupper boundexclusion
vertex integritygreenupper boundexclusion

Results