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

Ask an Expert

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

Write your message here..

Related Questions

Sparse matrix, memory address of any element of lower left triangular spars... memory address of any element of lower left triangular sparse matrix

Simplifying assumptions of wire frame representation, Simplifying Assumptio... Simplifying Assumptions of wire frame representation Neglect colour - consider Intensity: For now we shall forget about colour and restrict our discussion just to the intensi

Tape sort based on fibonacci distribution, how does we get fibonacci table ... how does we get fibonacci table in tape sort

Several operations on a aa-tree, The following are several operations on a ... The following are several operations on a AA-tree: 1. Searching: Searching is done using an algorithm which is similar to the search algorithm of a binary search tree. 2. Ins

Define approximating smooth surfaces with polygon nets, Approximating smoot... Approximating smooth surfaces with Polygon nets Networks of polygons are used to represent smooth surfaces. They are, of course, only an approximation to the true surface, but

What are the different ways of representing a graph, What are the different... What are the different ways of representing a graph? The different ways of representing a graph is: Adjacency list representation: This representation of graph having of an

Algorithms., what is algorithim? what is algorithim?

State about the pseudocode, State the Introduction to pseudocode No spe... State the Introduction to pseudocode No specific programming language is referred to; development of algorithms by using pseudocode uses generic descriptions of branching, loop

Explain decision tree, Decision Tree A decision tree is a diagram that ... Decision Tree A decision tree is a diagram that shows conditions and actions sequentially and therefore shows which condition is to be considered first, second and so on. It is

Last in first out method, This method is the reverse of FIFO and assumes th... This method is the reverse of FIFO and assumes that each issue of stock is made from latest items received in the enterprises .Thus if the last lot to be received is not sufficient