Q.1.
Every block with at least three vertices are __________connected.
Q.2.
A connected graph that has no cut vertices is called a ________.
Q.3.
To prove the statement P tautologically implies the statement Q, it is enough to prove that_________.
Q.4.
To prove the statement P is tautologically equivalent to the statement Q, it is enough toprove that _______.
Q.5.
Let R={(1,2),(3,4),(2,6.} and S={(4,3),(2,5),(6,6)} be a relation then R composite S=____.
Q.6.
The binary relation R = {(0), (a)} on A = {} is _______.
Q.7.
If in the truth table the answer column has the truth values both TRUE and FALSE then itis said to be ________.
Q.8.
The binary relation R = {(0), (a)} on A = {} is _______.
Q.9.
A graph is Eulerian if it contains __________.
Q.10.
Hamilton cycle is a cycle that contains every ________of G.