A Blog for all job aspirants in fullfilling their dreams through the body charged with a very sensitive and sacred task of making selection of the most capable and deserving persons for manning the civil services and posts which has a direct bearing on the quality of governance. It brings about PSC Training an PSC Coaching Online.
The Knowledge documents in this blog meant only to increase the general awareness of the readers. E&OE.

38. In any undirected graph, the sum of the degrees of all nodes is :(A) must be even(B) is always ODD(C) need not be even(D) is twice number of edges Ref: Common sense. Twice indicate the number will even. But ‘0’ is anexception. Then choice (c) is true.

39. An undirected graph is Eulerian if and only if all vertices of G are of thesum of the degrees of all nodes is :(A) Same degree(B) ODD degree(C) Need not be ODD(D) Is twice number of edges

40. An undirected graph G has n vertices n - 1 edges then G is :(A) Cyclic(B) Addition of edge will make it cyclic(C) Eulerian(D) Is a Tree

41.Graph having every pair of vertices connected is called :(A) Cycle graph(B) Complete graph(C) Peterson graph(D) Is a Tree

LinkWithin

Subscribe to RSS headline updates from: Powered by FeedBurner

Disclaimer : Blog Policies

This blog publishes various general knowledge. errors and omissions expected. The Knowledge documents in this blog meant only to increase the general awareness of the readers. If any of the information available on this blog violates or infringes any of your copyright protection, leave a comment . This blog makes no representations as to accuracy, completeness, correctness or validity of any information on this site and will not be liable for any errors, or delays in this information. The information contained in this blog is subject to change without notice. You may use contents in this blog only for personal use. Reproduction and republishing of any contents from here to any other websites or blogs is strictly prohibited.