See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions
Engineering GATE CBSE NCERT Psychology English Computer Constitution Astrology Yoga Economics Physics Biology Electronics Microprocessor Career Interview Anatomy Botany
Never Miss an Update
Subscribe to eduladder news letter Today
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to -gate-computer science-20121 AnswerLet G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to -gate-cse-20121 AnswerConsider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is ½. What is the expected number of unordered cycles of length three? -gate-computer science-20121 AnswerLet G be a simple undirected planar graph on 10 vertices with 15edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to -gate-computer science-20121 AnswerLet G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to A -gate-cse-20121 AnswerWhich of the following graphs has an Eulerian circuit? -computer science-gate-20071 Answerhow to find the number of bounded faces in an undirected graph?1 AnswerLet G be the non-planar graph with the minimum possible number of edges. Then G has -computer science-gate-20071 AnswerLet G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements: -gate computer science 20171 AnswerWhich of the following statements is/are TRUE for undirected graphs? -gate-computer science-20131 AnswerLet G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is ____. Gate-cs-20161 Answer Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____. -gate computer science 20171 AnswerGate-cs-20161 Answer Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is _______________.-gate-cse-20151 AnswerConsider the graph given below The two distinct sets of vertices which make the graph bipartite are? 1 AnswerUGC NET Computer Science Paper-2 December 2015 2. Which of the following statement(s) is/are false? 1 AnswerWhich of the following statements are TRUE? -gate-computer science-20131 AnswerLet G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest pat1 AnswerIn an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity, by -computer science-gate-20071 AnswerDefine undirected graph?1 Answer