GRAPH THEORY

4. If two terminals of a path are made to coincide, it will result in a _______.
6. _______ of a node is defined as the number of branches incident to it.
8. What is the maximum number of edges in a bipartite graph having 10 vertices?
10. ______ is the subset of branches and nodes of a graph.
12. ____ graph that do not intersect or cross at a point that is other than the node.

1. A linear graph is a collection of nodes and _______.
2. The maximum number of possible branches is equal to the number of_____.
3. There exists how many paths between any pair of nodes in a tree.
5. It is a loop which does not contain any other loops within it.
7. graph with all vertices having equal degree is known as a __________ graph.
8. A connected planar graph having 6 vertices, 7 edges contains _____________ regions.
9. _____ is defined as a connected sub-graph of a connected graph containing all the nodes of the graph but not containing any loops.
11. (n-1) is _____ of a graph