GO DISCRETE

MATHEMATICS
HOME MATERIAL EXERCISE ANSWER FOG

SITI MASRUHA
(090210101067)
ROHMATULLAH
(090210101088)
AHMAD ADI SETIAWAN
(090210101093)
 HOME MATERIAL EXERCISE ANSWER FOG

Definition:
DEFINITIONS • Digraph is an ordered pair of sets G =
(V, A), where V is a set of vertices
and A is a set of ordered pairs (called
TECHNIQUES
arcs) of vertices of V.
• Out-degree of vertex v is of its
neighbours. The out-degree is denoted
deg + (v).
• Diameter is the longest distance
between two vertices
 HOME MATERIAL EXERCISE ANSWER FOG

Construction Techniques
DEFINITIONS
(Generalised de Bruijn Digraphs)
• Let the vertices of digraphs be lable by 0,1...,
TECHNIQUES
n-1.
• A vertex u is adjacent to v if,

v ≡ du + i (mod n), i = 0,1,...,d-1

• Note: that when n= dk, the digraphs obtained
from this construction.
 HOME MATERIAL EXERCISE ANSWER FOG

Exercise 2, No 8.
• For given out degree ∆ = 3 and diameter D = 2, construct a
directed graph with the biggest possible number of vertices n∆,D.
• For given out degree d = 2 and diameter k = 2, construct a
directed graph with the biggest possible number of vertices n d,k .
 HOME MATERIAL EXERCISE ANSWER FOG

FIGURE 1

FIGURE 2

Figure 8.1
 HOME MATERIAL EXERCISE ANSWER FOG

FIGURE 1

Figure 8.2
HOME MATERIAL EXERCISE ANSWER FOG
HOME MATERIAL EXERCISE ANSWER FOG

BUTTERFLY GRAPH
 HOME MATERIAL EXERCISE ANSWER FOG

FIGURE

DEFINITION

APPLICATION

BUTTERFLY GRAPH
 HOME MATERIAL EXERCISE ANSWER FOG

FIGURE

DEFINITION

APPLICATION
 HOME MATERIAL EXERCISE ANSWER FOG

• The butterfly graph or bowtie graph is a

FIGURE planar undirected graph with 5 vertices
and 6 edges. It can be constructed by
joining 2 copies of the cycle graph C3 with
DEFINITION a common vertex and is therefore
isomorphic to the friendship graph F2.
• The butterfly Graph has diameter 2 and
APPLICATION girth 3, radius 1, chromatic number 3,
chromatic index 4 and is both Eulerian and
unit distance. It is also a 1-
vertex-connected graph and a 2-
edge-connected graph.
 HOME MATERIAL EXERCISE ANSWER FOG

FIGURE
In the context of fast Fourier transform
algorithms, a butterfly is a portion of
DEFINITION
the computation that combines the
results of smaller discrete Fourier
APPLICATION transforms (DFTs) into a larger DFT,
or vice versa (breaking a larger DFT
up into subtransforms)