Could you please help me on Discrete-mathematical-structures. I\'m not sure abou
ID: 3006844 • Letter: C
Question
Could you please help me on Discrete-mathematical-structures. I'm not sure about my anwser.
Let statements p and q be as follows p = "Every complete graph is regular." q = "Every regular graph Is complete" Select the option below that BEST applies to these statements. Statement p is true. Statement q is true. Both statments are true Neither statement is true QUESTION 2 Find the degree of vertex 5. 1 2 3 4 QUESTION 3 Is this graph regular? yes No Not enough information to decide If Ris the equivalence relation defined by the panition {{1. 2} {3 4}. {5}. {6} {7}} which of the graphs betov/represents the quotient graph G^R of the graph G represented belowExplanation / Answer
Q.1.
Ans - Statement p is true.
A complete graph has an edge between every pair of vertices. A regular graph is a graph where every vertex has the same degree. Therefore, every complete graph is regular.
Q.2.
Ans - 3
In graph theory, the degree of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice. As there are 3 edges incident to the vertex 5, its degree is 3.
Q.3.
Ans - No.
A regular graph is a graph where every vertex has the same degree. In the given graph, every vertex han not the same degree. (Degree of vertex 1 is 2 , vertex 2 is 3) So, it is not regular.
Preorder Search is visiting a parent first then visiting its children next. (asdfuoqwert)
Inorder Search is visiting a left child first, then visiting the parent next, and then visit the right child last. (dfsuoaqwret)
Postorder Search is visiting children first then visiting their parent next. (fdousrtewqa)