Let, D = be a directed graph or digraph,then D’ = is a subgraph if ___________

Let, D = be a directed graph or digraph,then D’ = is a subgraph if ___________ Correct Answer A’ ⊂ A and R’ = R ∩ (A’ x A’)

A directed graph or digraph is an ordered pair D where A(is a set of nodes of D) is a set and R(the elements of R are the arcs of D) is a binary relation on A. The relation R is called the incidence relation on D. Now, a digraph is a subgraph of D if i)A’ ⊂ A and ii)R’ = R ∩ (A’ x A’). If D’ D, D’ is a proper subgraph of D.
Bissoy MCQ

Related Questions

If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
A graph is said to be a directed graph if ________ of the graph has direction.
What is testing of a complete bipartite subgraph in a bipartite graph problem called?
A graph is ______ if and only if it does not contain a subgraph homeomorphic to k5 or k3,3.
A _______ is a graph with no homomorphism to any proper subgraph.
There are four students in a class namely A, B, C and D. A tells that a triangle is a bipartite graph. B tells pentagon is a bipartite graph. C tells square is a bipartite graph. D tells heptagon is a bipartite graph. Who among the following is correct?
A directed graph or digraph can have directed cycle in which ______
In the following passage, some of the words have been left out. Read the passage carefully and select the correct answer for the given blank out of the four alternatives.
To begin______, let us ask ___________ such an appellation, assuming it has only positive___________, was ever deserved in a city like Bengaluru. At the risk__________ earning the well-shaped wrath of fellow Bengalureans, let me explain that______ for a "peacefull" past apart, it would be difficult to assert that "Asia's Silicon Valley" had even a history of toleration of difference.
let us ask ___________ such an appellation
Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50.
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)?