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
I need to know about data structure and algorithms. can you help me?

what is an algorithms

I =PR/12 Numbers of years .Interest rate up to 1yrs . 5.50 up to 5yrs . 6.50 More than 5 yrs . 6.75 design an algorithm based on the above information

red black tree construction for 4,5,6,7,8,9

write an algorithm given each students name and grade points for six courses.find his grade point average and group students into the gpa groups 3.5


How to create an General Tree and how to search general tree?

implementation of fast fourier transforms for non power of 2

Q .  Write down the non-recursive algorithm to traverse a tree in preorder. Ans: T he Non- Recursive algorithm for preorder traversal is written below: Initially i

Q. Enumerate number of operations possible on ordered lists and arrays.  Write procedures to insert and delete an element in to array.