Question

(a) Are the vectors (1,3,2), (2,1,3) and (3,1,2) independent? Justify your result.

(b) What would be the largest eigen value and the corresponding eigen vector of (i) a complete graph Kn of n nodes and (ii) a complete bipartite Kn;n, considering both a undirected.

(c) Derive the eigen values and eigen vectors of a n-node acyclic directed graph.

(d) Given an adjacency matrix A of a directed graph, write python code to derive the co-citation and bibliographic coupling of the nodes in the graph.

Answer 1

Answer:

d) Given an adjacency matrix A of a directed graph, write python code to derive the co-citation and bibliographic coupling of the nodes in the graph.

Explanation:

l I

I hope