Posts Tagged ‘vertices’
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, December 24th, 2009
Finding the Function of a Directed Graph
Description
A detailed tutorial on finding the function of a directed graph. Step by step tutorial including several examples of finding functions of digraphs for reference.
Overview
A directed graph, more commonly known as a digraph, is the visual representation of a function or of a relation. As in any graph, there are points and lines – called vertices and edges in a digraph. Each edge has an arrow pointing to a vertex. The first vertex – the one the arrow comes from – is the x coordinate of an ordered pair. The second vertex – the one the arrow is pointing to – is the y coordinate of an ordered pair. In the case of double-sided arrows, two ordered pairs are made, with the x and y coordinates switching. This is done for every single vertex and edge on the graph.
Tags: arrow, coordinate. ordered, digraph, directed, discrete math, double, edges, expression, First, function, graph, lines, pair, points, relation, representation, second, side, vertex, vertices, visual, x, y
Posted in Discrete Math | No Comments »
Friday, November 20th, 2009
Overview of the Vertices of a Graph
Description
A detailed tutorial on the vertices of a grpah. Step by step tutorial including several examples of the vertices of a graph for reference.
Overview
The vertices of a graph are the number of lines extending from points on the graph. This is not the total number of edges – it is the number of edges extending from each point all added together. Each point has at least one vertex. Not every single point can have an odd number of vertices, and all the vertices cannot add up to an odd number, or it is not considered to be the graph of a function.
Tags: add, discrete math, edges, even, extending, function, graph, line, odd, point, vertex, vertices
Posted in Discrete Math | No Comments »
