Discrete Mathematics - Graph Theory

1. The minimum number of edges in a connected cyclic graph on n vertices is

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


2. The number of distinct simple graphs with up to three nodes is

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


3. A graph is planar if and only if it does not contain

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


4. In any undirected graph, the sum of degrees of all the nodes

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.


5. Number of vertices of ODD degree in a graph is

Cancel reply

Your email address will not be published.


Cancel reply

Your email address will not be published.