connected graph

Show Summary Details

Quick Reference

A graph in which there is a path from any one vertex to any other. So a graph is connected if it is ‘all in one piece’; that is, if it has precisely one component.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.