Scribd
Upload
57 views4 pages

Hurara Discrete Assignment

This document contains a student's discrete mathematics assignment submitted to COMSATS University, Attock Campus. It includes 4 questions: 1) Drawing a graph from an adjacency matrix. 2) Determining if a graph has an Euler circuit. 3) Finding edges, vertices, loops, and isolated nodes in a graph. 4) Calculating arrangements of letters in a word keeping vowels together. The student provides solutions explaining their work and reasoning for each question. Graphs, matrices, and calculations are shown.

Uploaded by

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

Hurara Discrete Assignment

This document contains a student's discrete mathematics assignment submitted to COMSATS University, Attock Campus. It includes 4 questions: 1) Drawing a graph from an adjacency matrix. 2) Determining if a graph has an Euler circuit. 3) Finding edges, vertices, loops, and isolated nodes in a graph. 4) Calculating arrangements of letters in a word keeping vowels together. The student provides solutions explaining their work and reasoning for each question. Graphs, matrices, and calculations are shown.

Uploaded by

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

COMSATS UNIVERSITY OF

ISLAMABAD,
ATTOCK
CAMPUS

Discrete Assignment

Submitted By:
HURARA AKRAM
Registration no:
FA18-BCS-007
Submitted To:
Khalid Iqbal
Date:
28-04-2019
Department of computer science
COMSATS UNIVERSITY OF ISLAMABD,ATTOCK CAMPUS

Q#1: Draw a graph with given adjacency matrix.

0 1 0
1 0 1
0 1 0
Solution:

Let “A”, “B”, “C“are the adjacent vertices.

Now
A B C
A 0 1 0

B 1 0 1

C 0 1 0

A e1 B

e2

This graph is for the given Adjacency matrix. A to B is 1 and B to A is also1 as


graph is not directed graph so we only draw one edge b/w A and B. Also for the B and C .

Q#2: Determine whether the following graph has a Euler Circuit and give reasons.

Solution:

Euler circuit:

An Euler circuit is a circuit that uses every edge in a graph with no repeats.

Being a circuit, it must start and end at the same vertex.


A e1 B e2 C

e13
e14 e12 e3
D e8 E e9
F

e10
e7 e11 e4

G e6 H e5 I

( A,e1,B,e2,C,e3,F,e4,I,e5,H,e11,E,e9,F,e10,H,e6,G,e7,D,e8,E,e12,B,e13,D,e14,A )

This is the Euler path of the graph for being Euler graph.

In this graph we start at a vertex “a” and trace along edges to get to other vertices, we
create a walk through the graph. The starting and ending vertices are the same (so you trace
along every edge exactly once and end up where you started).

Q#3: For the graph shown below

1- Find all the edges that are incident to V2.

2- Find all the vertices that are adjacent to V3.

3- Find all loops.

4- Find all parallel edges.

5- Find all isolated vertices.

Solution:

1. There are 4 incident edges on the vertices V2 i.e.point2, point 3, point 4, point 6

2. The on vertex which is adjacent to V3 is V2.

3. All loops in the graph are V1, V3, and V4.

4. The parallel edges in the graph are e3 and e4.

5. V5 is the only isolated vertex because V5is the only vertex which is not connected

To any vertex of the graph.


Q#4: How many different arrangements of the letters in the word "caught" can be formed
if the vowels must be kept next to each other.

Solution:

The word “caught” contains 6 letters.

In this word vowel letter are “au” and we consider it as a single letter.

So, letter be arrange as:

CGHT(au) consider as single letter

We can arrange 5 letters as

5p
5
=5!

=5x4x3x2x1

=120

We can arrange 2 vowels as

=2!

=2x1=2

So, required number of arrangement are = (120x2) =240 ways

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