|1 Crore+ students have signed up on EduRev. Have you?|
A graph is said to be a directed graph if ________ of the graph has direction.
If every branch of the graph has direction, then the graph is said to be a directed graph. If the graph does not have any direction then that graph is called undirected graph.
If no two branches of the graph cross each other, then the graph is called?
If a graph can be drawn on a plane surface such that no two branches of the graph cross each other, then the graph is called planar graph.
Number of twigs in a tree are? (where, n-number of nodes)
Twig is a branch in a tree. Number of twigs in a tree are n - 1. If there are 4 nodes in a tree then number of possible twigs are 3.
If the incident matrix of a graph is given below. The corresponding graph is?
For the given incidence matrix,
the corresponding graph is
considering the directions specified in the graph.
If a graph consists of 5 nodes, then the number of twigs in the tree is?
Number of twigs = n-1. As given number of nodes are 5 then n = 5. On substituting in the equation, number of twigs = 5 -1 = 4.
If there are 4 branches, 3 nodes then number of links in a co-tree are?
Number of links = b - n + 1. Given number of branches = 4 and number of nodes = 3. On substituting in the equation, number of links in a co-tree = 4 – 3 + 1 = 2.
If A represents incidence matrix, I represents branch current vectors, then?
If A represents incidence matrix, I represents branch current vectors, then the relation is AI= 0 that is its characteristic equation must be equated to zero
Loops which contain only one link are independent are called?
The addition of subsequent link forms one or more additional loops. Loops that contain only one link are independent are called basic loops.
Consider the graph given below. Which of the following is a not a tree to the graph?
Tree is sub graph which consists of all node of original graph but no closed paths. So, ‘d’ is not a tree to the graph.
The number of branches incident at the node of a graph is called?
Nodes can be incident to one or more elements. The number of branches incident at the node of a graph is called degree of the node.