In graph theory, describing a graph where removing any single point still leaves all remaining points connected to each other.
From 'bi-' (two) + 'connected' (joined). This term was formalized in 20th-century computer science to describe the connectivity properties of networks and graphs.
Try Another Word