Graph Theory
A
graph G = (V,E) consists of two sets V and E. The
elements of V are called vertices while that of E are
called _{i},v_{j} of
vertices
An
edge
having the same vertex at both ends is called a
Two
edges associated with the same pair of end vertices
are called
A
graph which does not contain loops or parallel edges
is called a
The
number of edges incident on a vertex v with loops
being counted twice is called the
A
graph in which all vertices are of equal degree is
called a
A
vertex having no incident edge is called an
A
graph having no edges is called a Theorem 1 : The sum of the degrees of all vertices of a graph is equal to twice the number of edges of the graph. Theorem 2 : A graph always contains a even number of vertices of odd degree. |

HOME PAGE mathematical formulae

--------------------------------------------------------------------------------------------------

---------------------------------------------------------------------------------------------------

disclaimer:

There is no guarantee about the data/information on this site. You use the data/information at your own risk. You use the advertisements displayed on this page at your own risk.We are not responsible for the content of external internet sites. Some of the links may not work