DM UINT III MCQ R

The graph representing universal relation is called

• Complete graph

• Partial digraph

• Empty graph

• Partial subgraph

A simple graph can have

• Multiple edges

• Self loops

• Parallel edges

• No Multiple ,Self, Parallel edges

Degree of graph with 12 vertices is

• 25

• 56

• 24

• 212

G is an undirected graph with n vertices and 26 edges such that each vertex of G has a degree at least 4. then the maximum possible value of n is

• 7

• 43

• 13

• 10

The relation

 $\le$  is a partial order if it is 

• Reflexive

• Anti symmetric 

• Transitive

• Reflexive, Anti symmetric , Transitive

In which of the following relations every pair of elements is comparable

• $\le$

• $\ge$

• $\subseteq$

• $\supseteq$

Let G be graph defined as the Hass diagram for the

 $\subseteq$  relation on the set  S {1,2,.........18} . How may edges are there in G?

• 43722

• 2359296

• 6487535

• 131963

In a star graph the degree of each and every vertex is

• same

• equal

• not equal

• none of the above

Bipartite graph are used in

• Modern coding theory

• coloring graph

• neural networks

• chemical bonds

The spectrum of a graph is .......if and only if it is ...........graph

• symmetry,bipartite

• transitive , bipartite

• cyclic,euler

• reflexive,planar