Q. An isomorphism of graphs G and H is a bijection f the vertex sets of G and H. Such that any two vertices u and v of G are adjacent in G if and only if ____________

View solution

Q. What is the grade of a planar graph consisting of 8 vertices and 15 edges?

View solution

Q. A _______ is a graph with no homomorphism to any proper subgraph.

View solution

Q. Which algorithm efficiently calculates the single source shortest paths in a Directed Acyclic Graph?

View solution

Q. The _______ of a graph G consists of all vertices and edges of G.

View solution

Q. A ______ in a graph G is a circuit which consists of every vertex (except first/last vertex) of G exactly once.

View solution

Q. A walk has Closed property if ____________

View solution

Q. A trail in a graph can be described as ______________

View solution

Q. Let a graph can be denoted as ncfkedn a kind of ____________

View solution

Q. Determine the edge count of a path complement graph with 14 vertices.

View solution

Q. The sum of an n-node graph and its complement graph produces a graph called _______

View solution

Q. In a directed weighted graph, if the weight of every edge is decreased by 10 units, does any change occur to the shortest path in the modified graph?

View solution

Q. Let G(V, E) be a directed graph where every edge has weight as either 1, 2 or 5, what is the algorithm used for the shortest path from a given source vertex to a given destination vertex to get the time complexity of O(V+E)?

View solution

Q. The chromatic number of a graph is the property of ____________

View solution

Q. If a graph G is k-colorable and k<n, for any integer n then it is ___________

View solution

Q. If Cₙ is the nth cyclic graph, where n>3 and n is odd. Determine the value of X(Cₙ).

View solution

Q. Determine the density of a planar graph with 34 edges and 13 nodes.

View solution

Q. If the number of vertices of a chromatic polynomial PG is 56, what is the degree of PG?

View solution

Q. For a connected planar simple graph G=(V, E) with e=|E|=16 and v=|V|=9, then find the number of regions that are created when drawing a planar representation of the graph?

View solution

Q. Suppose G be a connected planar graph of order n≥5 and size m. If the length of the smallest cycle in G is 5, then which of the following is true?

View solution