rectagraph
antiregular
triangle-free
complete graph
edge
independent set
empty graph
tree
connected graph
Laplacian matrix
spider graph
Menger's theorem
supervertex
incidence function
pseudoforest
matching
adjacency matrix
cage
biconnected
color
coloring
polygon-circle graph
hypergraph
point-to-point
Suurballe's algorithm
vertex cover
medial graph
chord
tie
interedge
crown graph
diagonal
edge list
undirected graph
endpoint
Bethe lattice
pseudo-edge
Hamiltonian path
complete bipartite graph
disassortative
degree sequence
Desargues graph
biclique
dominating set
nonblocker
pseudograph
Turán graph
cyclomatic
graph
locally finite
edge cover
superconcentrator
tournament
snark
boxicity
decycling
semi-transitive
gammoid
adjacency list
dual graph
cutwidth
connectivity
ultragraph
connected
node
orthoradial
directed graph
flag complex
Herschel graph
forest
cubic graph
straight
directed acyclic graph
acyclic digraph
Lemoine hexagon
cocktail party graph
bridge
dendrimer
king
concavo-convex
polynema
chordal
utility graph
Archimedean solid
triconnected
Johnson's algorithm
half-edge
outbranch
bidirected
cut
sandpile
Steiner tree
Eppstein's algorithm
trellis
chromatic number
Veblen's theorem
Moore graph

English words for 'A triangle-free connected graph where any two vertices have 0 or 2 common neighbors.'

As you may have noticed, above you will find words for "A triangle-free connected graph where any two vertices have 0 or 2 common neighbors.". 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