please no hand writing please no hand writing T F Q A pseud

please no hand writing please no hand writing

T & F Q

A pseudograph may include loops, as well as multiple edges connecting the same pair of vertices. If T is a full binary tree and has 5 internal vertices then the total vertices of T are 13

Solution

3) True
In a simple graph each edge connects two different vertices; and no two edges connect the same pair of vertices. Multi graphs can have multiple edges connecting the same two vertices. When m different edges connect vertices u and v, we say that [u,v] is an edge of multiplicity m. An edge that connects a vertex to itself is called a loop. A pseudo graph can include loops as well as multiple edges connecting the same pair of vertices.

4) False
If T is a full binary tree with i internal vertices, then T\'s total vertices = 2i + 1.
Therefore T has 2(5) + 1 vertices that is 11 vertices