Q.1.
In a graph if few edges have directions and few do not have directions then the graph iscalled _________.
Q.2.
An edge with same ends is called ___________.
Q.3.
A = {1,3,5,7,is a __________.
Q.4.
An edge with identical ends is called _________.
Q.5.
Two vertices which are incident with the common edge are called______________vertices.
Q.6.
Edges intersect only at their ends are called ________.
Q.7.
If an edge e is said to join the vertices u and v then the vertices u and v are called __.
Q.8.
A regular grammar contain rules of the form is _____.
Q.9.
A regular grammar contain rules of the form is _____.
Q.10.
The production S tends to A is of the type _____grammar.
Q.11.
The production S tends to aB is of the type ________grammar.
Q.12.
There are only five distinct Hasse diagrams for partially ordered sets that contain_______elements.
Q.13.
Boolean expression except 0 expressed in an equivalent form is called _____.
Q.14.
_________relations are useful in solving certain minimization problems of switchingtheory.
Q.15.
The number of elements in a square matrix of order n is _____.
Q.16.
Every non-trivial tree has at least _____ vertices of degree one.
Q.17.
A ____ is an edge e such that w(G-e)>w(G).
Q.18.
A ____ is an edge e such that w(G-e)>w(G).
Q.19.
Every connected graph contains a ________.
Q.20.
A minimal non-empty edge cut of G is called a _________.