Republic of Yemen University of Ibn Khaldoon Faculty of Engg, Even Semester Examination 2012/2013
This document is an exam for a Discrete Mathematics class at the University of Ibn Khaldoon in Yemen. It contains 6 questions covering topics like:
1) Identifying relations as symmetric, asymmetric, or anti-symmetric and determining if a given argument is valid or not.
2) Finding cut edges and vertices in graphs and providing recursive and explicit formulas.
3) Calculating order, size, degree sequences, and degree sets of graphs and evaluating expressions.
4) Determining if degree sequences can form simple graphs and defining weakly and strongly connected graphs.
5) Identifying if a statement is a tautology and drawing specific graphs.
6) Evaluating set statements
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
0 ratings0% found this document useful (0 votes)
30 views1 page
Republic of Yemen University of Ibn Khaldoon Faculty of Engg, Even Semester Examination 2012/2013
This document is an exam for a Discrete Mathematics class at the University of Ibn Khaldoon in Yemen. It contains 6 questions covering topics like:
1) Identifying relations as symmetric, asymmetric, or anti-symmetric and determining if a given argument is valid or not.
2) Finding cut edges and vertices in graphs and providing recursive and explicit formulas.
3) Calculating order, size, degree sequences, and degree sets of graphs and evaluating expressions.
4) Determining if degree sequences can form simple graphs and defining weakly and strongly connected graphs.
5) Identifying if a statement is a tautology and drawing specific graphs.
6) Evaluating set statements
1# (a) For each of the following relations on the set {a, b, c}, decide whether it is Symmetric, Asymmetric, AntiSymm ; (i) R1 = {(a,a), (a,c), (b,a), (b,c), (c,a), (c,a), (c,c)} (ii) R2 = { (b, b) }
(b) State whether the argument given is valid or not. If it is valid, identify the tautology on which it is based: " If you drive to work, then you reach tired. You reached tired. Therefore, you did drive to work."
2# (a) Find all the CUT_Edges and CUT_Vertices in the following graphs:
(b) Provide a Recursive and Explicit formulae for 3, -3, 3,-3, 3, -3,
3# (a) Determine the Order, the Size, the degree Sequence and the degree set of the following graphs: (i) C 4 , and (ii) K 5
(b) Find the following value: ( 8 . 0 4 . 2 7 6 . 2 + +
4# (a) Is there a simple graph with the following degree sequences: (Construct the graph ). (i) ( 1, 2, 3, 4, 4, 6 ), (ii) ( 3, 3, 3, 4, 1 ). (b) Give a definition for a weakly and strongly connected graph.
5# (a) Is the statement Tautology, ( ) P P P (b) Draw the following graphs : (i) the graph W 4 . (ii) the graph K 4
6# (a) Let A = { 1, 2, 5, 8, 11}. Identify each as TRUE or FALSE (i) A e | (ii) A _ } 3 , 1 { (iii) A A_ (b) Give a definition for a Null and strongly connected graph.