Posts Tagged ‘graph’
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 »
Thursday, December 31st, 2009
How to Write Step Functions
Description
A detailed tutorial on how to write step functions. Step by step tutorial including several examples of how to write step functions for reference.
Overview
A step function, also called a staircase function, is a finite linear combination composed of several different intervals. They are considered to be a piecewise constant function. The graph of a step function is often expressed as steps, or a staircase, which is how it got its name. It simply looks like several disconnected lines, with alternate open and closed ends so that it easily passes the vertical line test for functions.
Tags: closed, combination, constant, diconnected, discrete math, ends, finite, function, graph, intervals, line, linear, lines, open, piecewise, staircase, step, test, vertical
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 »
Tuesday, December 29th, 2009
How to Construct a Cayley Table
Description
A detailed tutorial on how to construct a Cayley table. Step by step tutorial including several examples of how to construct a Cayley table for reference.
Overview
A Cayley table is a table that expresses the structure of a finite set. A Cayley table is set up by having the elements of the set across the first row, and numbers going in a numerical order of n + 1 starting at 1 down the first column. Sometimes the table is simply different ways the elements can be ordered. Other times is is a true table, where an operation is performed between two numbers in the space where they cross each other. However, a true Cayley table must be constructed using an identity skeleton. Once an identity skeleton for the finite set has been decided on, the Cayley table can be filled out using the identity skeleton. Since there is more than one possible identity skeleton for a finite set, you may have to go through a trial and error process until you find the right one.
Tags: addition, Cayley, chart, column, cross, discrete math, division, elements, error, finite, graph, identity, multiplication, operation, order, process, row, set, skeleton, subtraction, table, trial
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 »
Thursday, December 10th, 2009
How to Join Tables and Charts
Description
A detailed tutorial on how to join tables and charts. Step by step tutorial including several examples on how to join tables and charts for reference.
Overview
A table, also referred to as a chart, is a way to record certain information so you can match it up quickly. They are very useful and are used in business all the time. It is possible to join certain tables. Provided that the tables share at least one common element, it is possible to combine them to form a new chart. Typically when you join tables you will either increase your columns and decrease your rows, or increase your rows and decrease your columns, depending on what way your graph is oriented and what elements are the same. Sometimes rows or columns may remain the same, but if both remain the same, then that means there is no join – it means you have the same exact chart.
Tags: algebra, business, chart, column, combine, common, decrease, element, graph, increase, information, join, record, row, table
Posted in Algebra | 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 »
Thursday, November 19th, 2009
Overview of the Cost Function
Description
A detailed tutorial on the cost function. Step by step tutorial including several examples of the cost function for reference.
Overview
The cost function is a name for a function that is being used in optimization. It is a very important part of an optimization problem. The cost function can be any graph, because all it refers to is the function – the function could be different every time, and it could still be called the cost function. What we learn from this is that the cost function is not unique.
Tags: algebra, constraints, cost, domain, energy, function, functional, graph, linear, maximize, minimize, objective, optimization, solution, unique, variable
Posted in Algebra | No Comments »
Tuesday, November 17th, 2009
How to Draw a Boundary Line
Description
A detailed tutorial on how to draw a boundary line. Step by step tutorial including several examples on how to draw a boundary line for reference.
Overview
A boundary line is used when graphing inequalities on a number line or a regular Cartesian graphing system. What the boundary line does is connect the two points in the inequality – in other words, it sets a boundary of what an unknown variable would be on that inequality. The boundary line can either be solid or dashed. The boundary line is only dashed when it is drawn on a regular graph, to express that the line was somewhere else at one point and was then moved. In all other cases, the boundary line is solid.
Tags: algebra, boundary, closed, coordinates, dashed, equal, graph, greater, inequality, interval, less, line, number, open, points, solid, then, to
Posted in Algebra | No Comments »
