COMPUTER SCIENCE AND ENGINEERING
SOFTWARE ENGINEERING
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
One row and one column in graph matrix
|
|
|
Two rows and two columns in graph matrix
|
|
|
One row and two columns in graph matrix
|
|
|
None of the above
|
Detailed explanation-1: -In graph theory, an adjacency matrix is nothing but a square matrix utilised to describe a finite graph. The components of the matrix express whether the pairs of a finite set of vertices (also called nodes) are adjacent in the graph or not.
Detailed explanation-2: -Hence in each column of an incidence matrix there are exactly two unit entries. The number of 1 s in the ith row is the degree of the vertex vi. First, suppose that G is a simple labeled connected graph. Theorem 2.1.
Detailed explanation-3: -Two main types of matrix setups are industry-practice: adjacency matrices & incidence matrices. Connected vertices are known as neighbor, or adjacent to one another. An adjacency matrix therefore describes whether two vertices are adjacent (1) or not (0).
Detailed explanation-4: -Explanation: Every column of the incidence matrix may contain only +1 and-1 as non zero entries rank would be less than n.