king
superconcentrator
breadth
Hamiltonian path
Suurballe's algorithm
indegree
directed path
path length
Johnson's algorithm
outdegree
predecessor
clique number
flow network
spider graph
strongly connected
undirected path
adjacency matrix
closeness
outbranch
valency
complete graph
bidirected
edge
hypergraph
Menger's theorem
connected graph
medial graph
vertex cover
Tutte matrix
cutwidth
Steiner tree
triangle-free
dual graph
reachable
biclique
utility graph
ultragraph
dominating set
incidence function
Desargues graph
pseudograph
connectivity
reachability
gammoid
Chinese postman problem
cubic graph
vertex
edge list
edge cover
tournament
multidigraph
Moore graph
complete bipartite graph
graph theory
nonblocker
intervertex
dominate
dismantlable
polycycle
independence number
directed edge
Kosaraju's algorithm
order
laceable
regular graph
Coxeter graph
connected
polytree
edge covering number
edge set
interproximate
pathfinding
degree sequence
supervertex
boxicity
altermatic
caterpillar tree
line graph
digraph
pseudo-edge
lignel
circumconic
centrality
polygon-circle graph
dendrimer
coloring
independent set
cage
tie
directed
bouquet of circles
quadrivalent
wedge of circles
disassortative
rose
pointel
Veblen's theorem
diameter
cocktail party graph

English words for 'A vertex in a directed graph which can reach every other vertex via a path with a length of at most 2.'

As you may have noticed, above you will find words for "A vertex in a directed graph which can reach every other vertex via a path with a length of at most 2.". Hover the mouse over the word you'd like to know more about to view its definition. Click search related words by phrase or description. to find a better fitting word. Finally, thanks to ChatGPT, the overall results have been greatly improved.

Recent Queries