Posts Tagged ‘edge’
Tuesday, January 5th, 2010
An Introduction to Bridges
Description
A detailed tutorial on mathematical bridges. Step by step tutorial including several examples of mathematical bridges for reference.
Overview
The bridge is a type of mathematical structure. When an edge is taken off of a connected graph, and the resulting graph is disconnected, that edge is considered to be a bridge. Either way, the resulting graph is called a subgraph. The name “bridge” was thought up for these edges because they connect one part of the structure to another part of the structure, and are extremely important in a graph.
Tags: bridge, connected, disconnected, discrete math, edge, graph, resulting, structure, subgraph, vertex, vertices
Posted in Discrete Math | No Comments »
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 »
Thursday, November 19th, 2009
Finding the Altitude of a Triangle
Description
A detailed tutorial on how to find the altitude of a triangle. Step by step tutorial including several examples of how to find the altitude of a triangle for reference.
Overview
The altitude is just a way of saying the height of something. Typically, the term altitude is only used to refer to triangles. In triangles, the altitude is a little different from the height. Unlike the height, the altitude can be taken from three points of the triangle – it can be taken through the center of any of the three vertexes of the triangle. The altitude goes from the vertex to the line across from it, forming a right angle with that line. All three altitudes should intersect at a common point in the center of the triangle, known as the orthocenter.
Tags: altitude, angle, center, edge, Geometry, height, intersect, line, orthocenter, perpendicular, point, triangle, vertex
Posted in Geometry | No Comments »