A graph in which at least one path (disregarding orientation) exists between any two nodes of the graph is a

A graph in which at least one path (disregarding orientation) exists b

1.	A graph in which at least one path (disregarding orientation) exists between any two nodes of the graph is a
A.	connected graph
B.	directed graph
C.	sub-graph
D.	fundamental graph
Answer» B. directed graph

Discussion

No Comment Found

Related MCQs

If [A] Matrix is Incidence matrix then which one of the following is true?
A reduced incidence matrix of a graph is given by \(\left[ A \right] = \left[ {\begin{array}{*{20}{c}}1&1&0&0&1\\0&{ - 1}&1&0&0\\{ - 1}&0&{ - 1}&{ - 1}&0\end{array}} \right]\) The number of possible trees is
In which type of network topology computers are connected to a centralise Hub/switch
A network uses a fully interconnected mesh topology to connect 10 nodes together. The number of links required will be
Consider the following statements regarding the complete incidence matrix (A) of order n × b(a) The elements aij of A = 1, if branch j is associated with node i and orientation is towards node i(b) The element aij of A = -1, if the branch j is the cut set i and the orientation coincide(c) The element aij of A = 1, if the branch j is associated with node i and orientation is away from node i(d) The element aij of A = 0, if the branch j is not associated with node iWhich of the above statements are correct?
Consider the following data for twigs and links:N = Number of nodesL = Total number of linksB = Total number of branchesThe total number of links associated with a tree is
Following is not the property of a complete incidence matrix:
In a singly connected network, there are b number of branches and n number of nodes, Then the number of independent meshes M and independent nodes N are respectively
According to network graphs, the network with:1. Only two odd vertices is traversable2. No odd vertices is traversable3. Two or more than two odd vertices are traversableWhich of the above statements is / are correct?
A connected network of N > 2 nodes has at most one branch directly connecting any pair of nodes. The graph of the network _____.

A graph in which at least one path (disregarding orientation) exists between any two nodes of the graph is a

Discussion

No Comment Found

Related MCQs

Reply to Comment