Scribd
Upload
85 views

Graph Theory: Its Endpoints

A graph consists of vertices connected by edges. A graph can be simple, with no loops or parallel edges, or it can be a multigraph or pseudograph allowing loops and parallel edges. Special types of graphs include complete graphs where all vertices are connected, bipartite graphs where vertices are divided into two sets with edges only between sets, and regular graphs where all vertices have the same degree. Graphs can be represented using an adjacency matrix showing the connections between vertices.

Uploaded by

Vivek sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
85 views

Graph Theory: Its Endpoints

A graph consists of vertices connected by edges. A graph can be simple, with no loops or parallel edges, or it can be a multigraph or pseudograph allowing loops and parallel edges. Special types of graphs include complete graphs where all vertices are connected, bipartite graphs where vertices are divided into two sets with edges only between sets, and regular graphs where all vertices have the same degree. Graphs can be represented using an adjacency matrix showing the connections between vertices.

Uploaded by

Vivek sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Graph theory

 A Graph consists of two finite sets :a set V(G) of vertices and a set E(G) of edges ,
where each edge is associated with a set consisting of either one or two vertices called
its endpoints
 The correspondence from edges to endpoints is called edge-endpoints function
 An edge with one endpoint is called a loop, and two distinct edges with the same
endpoints are said to be parallel
 An edge is said to connect its endpoints
 Two vertices that are connected by an edge is said to be adjacent
 A vertex is said to be a Loop if it is adjacent to itself.
 An edge is said to be incident on each of its endpoints, and the two edges incident on
the same endpoints are said to be Adjacent.
 A vertex on which no edges are incident is called isolated.
 A graph with no vertices is called empty, and one with at least one vertex is said to
non empty

Special types of graphs:


 Simple graph: A graph which has no loops or edges is called simple graph

 Multi graph: A graph, which has multiple edges, is called Multi graph.
 Pseudograph: A graph, which contains both loops and multiple edges.

 A complete graph: A simple graph with n vertices v1, v2, v3…vn whose set of edges
contains exactly one edge for each pair of distinct vertices. In other words, A
Graph in which all the vertices are connected with every other vertex. It is
denoted by Kn.

 Bipartite graph: A graph is said to be Bipartite if the vertex set of the graph can be
divided into two parts such that every vertex in the graph starts from the first set and
ends in the second set and the vertices which are adjacent are not in the same set.

 Complete Bipartite graph: Let m and n be positive integers. A complete bipartite


graph on (m, n) vertices denoted by Km,n is a simple graph with vertices v1, v2, v3…vm
and w1, w2, w3…wn that satisfies the following properties:
(i) There is and edge from each vertex to each vertex wj
(ii) There is not an edge from any vertex vi to any other vertex vk.
(iii) There is no edge from any vertex wj to any other vertex wl.

 Regular Graph: A graph is said to be regular if every vertex has the same
degree.
Concept of degree:
 Let G be a graph and v is a vertex of G. The degree of v denoted as deg(v) , equals the
number of edges that are incident on v, with an edge that is a loop
counted twice .

 The total degree of G is the sum of the degrees of all vertices of G.

 Odd vertex: A vertex with an odd degree.


 Even vertex: A vertex with an even degree.

Concepts of Path, Walk and Trail:


 A walk from v to w is a finite alternating sequence of adjacent vertices and edges of
G. Thus a walk is of the form v=v0e1v1e2…….vn-1envn=w.
 The trivial path from v to w consists of single vertex v.
 A path from v to w is a walk that contains no repeated vertex.
 A trail is a walk that contains no repeated edge.
 A closed walk starts and ends with the same vertex.
 A circuit is a simple walk that contains no repeated edge.
Connectedness:
 Let G be a graph. Two vertices v and w of G are connected if and only if, there
exists a walk from v to w.
 The graph is said to be connected if and only if given any two vertices v and w,
there is a walk from v to w.
 A graph H is said to be a connected component of a graph G if and only if:
(i) H is a sub graph of G
(ii) H is connected
(iii) No connected sub graph of G has H as a sub graph and contains vertices or edges
that are not in H.

Matrix representation of a graph:


 Let G be a directed graph with ordered vertices v1, v2, v3…vn. The adjacency
matrix of G is a nxn matrix A=(aij) over the set of non negative integers such that
aij=the number of arrows from vi to vj

You might also like