Cycles in a graph
The total number of Hamiltonian circuits in a complete undirected graph of n vertices will be ____
If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is _________
The time complexity to find a Eulerian path in a graph of vertex V and edge E is
Consider a connected multigraph with 8 vertices has an Euler circuit. Which of the following degrees is possible for each vertex so that the graph has an Euler circuit?
The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is
In a weighted graph G, what is the time complexity of finding both an Euler circuit and a minimum spanning tree?
What is the maximum number of edges possible in a planar graph with n vertices (n ≥ 3) that has no triangular faces?
In a tournament graph with n vertices, what is the minimum number of edges that must be reversed to make the graph strongly connected?
In a graph G with n vertices, if the sum of degrees of any two non-adjacent vertices is at least n, then G must contain a:
Given a connected graph G with n vertices and n edges, which of the following must be true?
In a 3-regular connected graph G with 8 vertices, how many different perfect matchings are possible?