Tuesday, December 29th, 2009
How to Identify a Disconnected Graph
Description
A detailed tutorial on how to identify disconnected graphs. Step by step tutorial including several examples of disconnected graphs for reference.
Overview
A disconnected graph is a graph where not every single vertex is connected to all other vertices. Typically, graphs will have paths from all vertices, but if there is not a direct path from each and every vertex, then it is considered to be a disconnected graph. Some common shapes that are seen that are disconnected graphs are stars, rectangles, and hexagons. The opposite of a disconnected graph is a connected graph.
Tags: closed, connected, direct, disconnected, discrete math, edge, graph, hexagon, open, opposite, path, rectangle, shape, star, triangle, vertex, vertices, walk
Posted in Discrete Math | No Comments »
Tuesday, December 29th, 2009
How to Identify a Connected Graph
Description
A detailed tutorial on how to identify connected graphs. Step by step tutorial including several examples of connected graphs for reference.
Overview
A connected graph is a graph where every single vertex is connected to every other vertex. This does not mean to simply have a clear path from one vertex to another – it means there needs to be a direct path, or an edge, between two vertices. A triangle is a commonly seen shape that is a connected graph. The opposite of a connected graph is a disconnected graph.
Tags: closed, connected, direct, disconnected, discrete math, edge, graph, hexagon, open, opposite, path, rectangle, shape, star, triangle, vertex, vertices, walk
Posted in Discrete Math | No Comments »
