(b) Let G' be the graph defined by the adjacency matrix A'. For the graph G'(i) determine whether the graph G' is weakly connected? Is it stronglyconnected? Find all strongly connected components of the graph G';(ii) determine the in-degree and the out-degree sequences;(iii) determine the in-degree and the out-degree distributions;(iv) evaluate the normalised Katz centrality of all nodes of the graph G'.Hint: You may wish to use the definition of the Katz centrality in terms ofnodes connectivities instead of a formula in terms of the inverse matrix. Question 1Let A and A' be two matrices defined below(0 1 1 1 0 0 0 0 0 0V1 0 0 0 1 1 0 0 0 01 0 0 0 0 0 1 10 01 0 0 0 00 0 0 10 10 0 0 0 0 0 0 00 1 0 0 0 0 0 0 0 00 0 10 0 0 0 0 0 00 0 10 00 0 0 0 00 0 0 10 00 0 0 00 0 0 10 00000,0 0 0 0 0 0 0 0 0 0Y1 0 0 0 0 00 0 001 0 0 0 0 0 0 0 0 01 0 0 0 0 0 0 0 0 00 1 0 0 0 0 0 0 0 00 1 0 0 0 0 0 0 0 00 0 10 0 0 0 0 0 00 0 1 0 00 0 0 0 00 0 0 1 0 0 0 0 0 00 0 0 1 0 0 0 0 0 0A =A'(a) Let G be the graph defined by the adjacency matrix A. For the graph G(i) determine whether the graph G is directed or undirected;(ii) find the number of nodes and edges of the graph G;(iii) draw the graph G;(iv) evaluate normalized degree centralities for all nodes;(v) evaluate average clustering coefficient and the transitivity of the graph G;(vi) compute the diameter Dg of the graph G, and indicate at least one pair ofnodes which are at distance DG;(vii) find the minimal number of edges that need to be added to the graph G toreduce its diameter. Give at least one example of such edges;(b) Let G' be the graph defined by the adjacency matrix A'. For the graph G'

Since the questions contains many subparts as per the guidelines I am answering the first three…

Question 1 Let A and A' be two matrices defined below (0 1 1 1 00 0 0 0 0V 100 0 1 10 0 0 0 100 0 00 1 10 0 100 0 00 0 0 1 1 010000 0 0 0 0 0 10 0 00 0 0 0 0 0 0 10 0 0 0 0 0 0 0 0 10 0 0 0o0 0 0 0 0 0 1 00 0 0 0 0 0 0 0 10 000 00, 1 00 0 0000 00 100 0 000 0 0 0 1000 000 0 00 0 10 0 00 00 0 0 A = A' = %3D 010 0 0000 0 0 0 0 10 0 0 0 0 0 0 0 0 10 0 0 0 0 00 0 0 0 100 0 0 0 0 0 0 0 1 0 00 0 0 0 (a) Let G be the graph defined by the adjacency matrix A. For the graph G (i) determine whether the graph G is directed or undirected; (ii) find the number of nodes and edges of the graph G; (iii) draw the graph G;

Question 1 Let A and A' be two matrices defined below (0 1 1 1 00 0 0 0 0V 100 0 1 10 0 0 0 100 0 00 1 10 0 100 0 00 0 0 1 1 010000 0 0 0 0 0 10 0 00 0 0 0 0 0 0 10 0 0 0 0 0 0 0 0 10 0 0 0o0 0 0 0 0 0 1 00 0 0 0 0 0 0 0 10 000 00, 1 00 0 0000 00 100 0 000 0 0 0 1000 000 0 00 0 10 0 00 00 0 0 A = A' = %3D 010 0 0000 0 0 0 0 10 0 0 0 0 0 0 0 0 10 0 0 0 0 00 0 0 0 100 0 0 0 0 0 0 0 1 0 00 0 0 0 (a) Let G be the graph defined by the adjacency matrix A. For the graph G (i) determine whether the graph G is directed or undirected; (ii) find the number of nodes and edges of the graph G; (iii) draw the graph G;

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

0 1 the inverse of matrix Select one: a. 1 0 b. 1 0 1 1 0 1 1 0 d. 1 0
Let 0 0 0 0 0 1 0 0 0 E = 1 5 0 10 0 0 0 0 1 0 L0 0 0 0 1 be an elementary matrix. What is the inverse af E? -5 0 0 0 0 0 10 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 5 0 10 0 0 0 1 0 0 0 0 1 10 0 0 0 0 10 00 1 0 0 100 5 0 0 0 10 0 0 0 0 1 [1 0 0 0 1. 1 -5 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 1 0 0 0 0 0 0 0 1. 0 0 0 0 1 0
Let X = A 0 (19) BA for 2 x 2 matrices A and B, with A invertible. Which of the following statements is true? = € M4 (R)
[2 0 01 Let A = 1 2 1 lo 1 2] Find two matrices that are similar to matrix A.
Let A = Find two different diagonal matrices D and the corresponding matrix S such that A = SDS-¹ -88 D₂ = --[88) -188 0 0 --[(86) D₁ = 0
1. Let A be a square matrix whose Jordan canonical form is (1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 10 0 0 0 00 0 0 0 1 0 0 0 0 0 0 0 0 0 2 10 00 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 2 1 0 0 0 0 0 0 0 0 0 0 0 00 0 2 0 0 2 0 (a) Is A nonsingular? Explain. (b) Write down all the eigenvalues of A and their algebraic and geometric multiplicities. (c) Let K be the nullspace of (A – I)? where I is the 9 x 9 identity matrix. Evaluate dim K.
(b) Let V = P4 (R) and consider the inner product on V given by 1 (u, v) = [² u(x)v(x) dx Calculate the angle between f, g € V given by ƒ(x) = ½ + xª and g(x) = 6x.
2. Consider the following matrices : 1 2 -1 3 [ 1 0 2 3 -1 0 A = and B : 4 2 -2 5 (a) Find At. (b) Use the definition of matrix multiplication given in Beezer (page 179) to compute the matrix product AB.
In Exercises 1 t 2 determine which matrices are in reduced cchelon form and which others are only in echelon form. 1 I0 0 0 1. a. 0 1 0 0 1 2 с. d. 3 3 0 0 4 2. а. b. 1 1 1 с. 1 d. 3 - - - -2 O 0
3.5.2.f