Scribd
Upload
66 views18 pages

GT UNIT4 Directed Graph TREE

The document defines and describes digraphs, which are directed graphs consisting of vertices and directed edges. It covers topics like types of digraphs such as simple, asymmetric, and symmetric digraphs. It also discusses concepts like parallel edges, connectivity, paths, and representations of digraphs like adjacency matrices.

Uploaded by

iamsorryabhu0406
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
66 views18 pages

GT UNIT4 Directed Graph TREE

The document defines and describes digraphs, which are directed graphs consisting of vertices and directed edges. It covers topics like types of digraphs such as simple, asymmetric, and symmetric digraphs. It also discusses concepts like parallel edges, connectivity, paths, and representations of digraphs like adjacency matrices.

Uploaded by

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

DIGRAPH DEFINITION

A digraph D consists of a finite set V of points and a collection of ordered


pairs of distinct points.
Any such pair (u, v) is called an arc or directed line and will usually be
denoted uv.
The arc uv goes from u to v and is incident with u and v.
u is adjacent to v and v is adjacent from u.
In otherwords,
A directed graph or a digraph G consists of a set of vertices V = {v1, v2,
.....}, a set of edge E = {e1, e2, .....} and a mapping that maps every
edge onto some ordered pair of vertices (vi, vj).
A digraph is also referred to as an oriented graph.

Fig. .(a) Directed graph with 5 vertices and 10 edges.

edges e8, e9, and e10 are parallel, whereas edges e2 and e3 are not
v5 is the initial vertex and v4 is the terminal vertex of edge e7.
An edge for which the initial and terminal vertices are the same forms
a self-loop, such as e5.

In a digraph an edge is not only incident on a vertex but is also incident


out of a vertex and incident into a vertex.
The vertex vi, which edge ek is incident out of, is called the initial vertex
of ek.
The vertex vj, which ek is incident into, is called the terminal vertex of
ek.

in the digraph in Fig., the edge e1 is incident out of the vertex v1 and
incident into the vertex v2, v1 is the initial vertex and v2 is the
terminal vertex of the edge e1.
For a self-loop in a digraph, the initial and terminal vertices are one
and the same.
In Fig. the edge e3 is a self-loop with v3 as the initial and terminal
vertex.
The number of edges incident out of a vertex vi is called the out-degree

(or out-valence or outward demidegree) of vi and is written as

The number of edges incident into vi is called the in-degree (or


invalence or inward demidegree)
The out-degrees and in-degrees of the six vertices of the digraph
shown in Fig.

in any digraph G the sum of all in-degrees is equal to the sum of all
out-degrees, each sum being equal to the number of edges in G; that
is,
Two directed edges are said to be parallel if they are mapped onto the
same ordered pair of vertices. That is, in addition to being parallel in the
sense of undirected edges, parallel directed edges must also agree in
the direction of their arrows.

For two digraphs to be isomorphic not only must their corresponding


undirected graphs be isomorphic, but the directions of the corresponding
edges must also agree.

Fig.9-2 shows two digraphs that are not isomorphic.


TYPES OF DIGRAPHS
Simple Digraphs: A digraph that has no self-loop or parallel edges is
called a simple digraph

Asymmetric Digraphs: Digraphs that have at most one directed edge


between a pair of vertices, but are allowed to have self-loops, are called
asymmetric or antisymmetric.
digraph in Fig. is asymmetric.

Symmetric Digraphs: Digraphs in which for every edge (a, b) (i.e., from
vertex a to b) there is also an edge (b, a).

Fig. symmetric digraph.

A digraph that is both simple and symmetric is called a simple


symmetric digraph.
Digraph that is both simple and asymmetric is simple asymmetric

complete symmetric digraph is a simple digraph in which there is exactly


one edge directed from every vertex to every other vertex
complete symmetric digraph of n vertices contains n(n – 1) edges.

Fig. Complete Symmetric Digraph of Four Vertices.

complete asymmetric digraph is an asymmetric digraph in which there


is exactly one edge between every pair of vertices
complete asymmetric digraph of n vertices contains n(n – l)/2 edges,
A complete asymmetric digraph is also called a tournament or a
complete tournament.

PARALLEL EDGES
Two (directed) edges e and e′ of a digraph D are said to be parallel if e
and e′ have the same initial vertex and the same terminal vertex.
In the digraph in Fig. the edges e6 and e7 are parallel edges whereas the
edges e1 and e9 are not parallel.
DIGRAPHS AND BINARY RELATIONS
The theory of graphs and the calculus of binary relations are closely
related.
In a set of objects, X, where
X = (x1, x2, . . .},
a binary relation R between pairs (xi, xj) may exist.

xi has relation R to xj.


Each of these relations is defined only on pairs of numbers of the set,
and the name binary relation.

DIRECTED PATHS AND CONNECTEDNESS

The word “path” in a digraph could mean either a directed path or a


semipath, and similarly for walks, circuits, and cutsets.
A walk in a digraph can mean either a directed walk or a semiwalk.

A directed walk from a vertex vi to vj is an alternating sequence of vertices


and edges, beginning with vi. and ending with vj, such that each edge is
oriented from the vertex preceding it to the vertex following i

CONNECTED DIGRAPHS
Strongly Connected
A digraph G is said to be strongly connected if there is atleast one
directed path from every vertex to every other vertex.
Weakly Connected
A digraph G is said to be weakly connected if its corresponding
undirected graph is connected but G is not strongly connected.
Accessibility: In a digraph a vertex b is said to be accessible (or
reachable) from vertex a if there is a directed path from a to b.
Digraph G is strongly connected if and only if every vertex in G is
accessible from every other vertex.
ADJACENCY MATRIX OF A DIGRAPH

Fig. Digraph and its Adjacency Matrix.

Theorem Let G be a connected graph. Then G is orientable if and only


if each edge of G is contained in at least one cycle.
Component and Fragments
Each maximal connected (weakly or strongly) subgraph of a digraph
G is called a component of G. But within each component of G the
maximal strongly connected subgraphs are called the fragments (or
strongly connected fragments) of G.
A tournament is a directed graph (digraph) obtained by assigning a
direction for each edge in an undirected complete graph.
It is an orientation of a complete graph, or equivalently a directed graph in
which every pair of distinct vertices is connected by a directed edge (often,
called an arc) with any one of the two possible orientations.
The name tournament originates from such a graph's interpretation as the
outcome of a round-robin tournament in which every player encounters
every other player exactly once, and in which no draws occur.
In the tournament digraph, the vertices correspond to the players.
The edge between each pair of players is oriented from the winner to the
loser.
If player a beats player b , then it is said that a dominates b. If every player
beats the same number of other players (indegree = outdegree), the
tournament is called regular.
THEOREM An arborescence is a tree in which every vertex other than the root has an indegree of
exactly one.
THEOREM In an arborescence there is a directed path from the root R to every other vertex.
Conversely, a circuitless digraph G is an arborescence if there is a vertex v in G such that every other
vertex is accessible from v, and v is not accessible from any other vertex.
Labeled Trees
Definition − A labeled tree is a tree the vertices of which are
assigned unique numbers from 1 to n. We can count such trees for
small values of n by hand. Two labeled trees are isomorphic if their
graphs are isomorphic and the corresponding points of the two trees
have the same labels

Definition − An unlabeled tree is a tree the vertices of which are


not assigned any numbers.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy