Find the adjacency matrix, Data Structure & Algorithms

Consider the digraph G with three vertices P1,P2 and P3 and four directed edges, one each from P1 to P2, P1 to P3, P2 to P3 and P3 to P1.

a. Sketch the digraph.

b. Find the adjacency matrix M of G.

c. Use the adjacency formula for inverses to find g(z)=(I - zM)-1.

d. Expand the (1,3) entry of g(z) as a power series up to terms of order 6.

e. Find the number of walks of length 6 from P1 to P3.

Posted Date: 3/12/2013 3:44:37 AM | Location : United States







Related Discussions:- Find the adjacency matrix, Assignment Help, Ask Question on Find the adjacency matrix, Get Answer, Expert's Help, Find the adjacency matrix Discussions

Write discussion on Find the adjacency matrix
Your posts are moderated
Related Questions
A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree

Explain about the Abstract data type Abstract data type (ADT) A set of values (the carrier set) and operations on those values

Write an algorithm for searching a key from a sorted list using binary search technique 1.   if (low > high) 2.     return (-1) 3.    mid = (low +high)/2; 4    .if ( X

Draw trace table and determine output from the following flowchart using following data: Number = 45, -2, 20.5

Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Problem Your LC code is stored in a memory location as shown and the variable name is LC                  LC Memory address       Content(LC code)

In the earlier unit, we have discussed about the arrays. Arrays are data structures of fixed size. Insertion & deletion involves reshuffling of array elements. Thus, arraymanipulat

Define tractable and intractable problems Problems that can be solved in polynomial time are known as tractable problems, problems that cannot be solved in polynomial time are

You need to write a function that performs multiplication of two numbers in your data structure. Again, remember how you multiply numbers in base 10 and you should be fine. Multipl

The two famous methods for traversing are:- a) Depth first traversal b) Breadth first