 |
|
| A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
| • HOME • ABOUT • CATEGORIES • USE OF TEXT AND IMAGES • NEWSLETTER   
|
connected graph
A graph in which a path exists between all pairs of vertices. If the graph is also a directed graph, and there exists a path from each vertex to every other vertex, then it is a strongly-connected graph. If a connected graph is such that exactly one edge connects each pair of vertices, then it is said to be a complete graph.
Related category
• GRAPHS AND GRAPH THEORYAlso on this site:
Encyclopedia of Alternative Energy & Sustainable Living
Encyclopedia of History