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

Good characteristies of algorithm, what are the characteristies of good alg... what are the characteristies of good algorithm

Linked lists, representation of links list in memory representation of links list in memory

Curve, write a c++ program to find out the area of a curve y=f(x) between x... write a c++ program to find out the area of a curve y=f(x) between x=a and x=b

Explain threaded binary tree, Threaded Binary Tree : If a node in a bin... Threaded Binary Tree : If a node in a binary tree is not having left or right child or it is a leaf node then that absence of child node is shown by the null pointers. The spac

Mcs-021, #questWrite an algorithm for multiplication of two sparse matrices... #questWrite an algorithm for multiplication of two sparse matrices using Linked Lists.ion..

Enumerate about the concept of container, Enumerate about the concept of co... Enumerate about the concept of container A Container can have a size() operation. We can also ask (somewhat redundantly) whether a Container is empty. And even though a Contain

What is a spanning tree of a graph, What is a Spanning tree of a graph? ... What is a Spanning tree of a graph? A Spanning Tree is any tree having of vertices of graph tree and some edges of graph is known as a spanning tree.

What is diffuse illumination, Diffuse Illumination Diffuse illuminatio... Diffuse Illumination Diffuse illumination means light that comes from all directions not from one particular source. Think about the light of a grey cloudy day as compared to

First class Abstract data type , 3. A function to convert a complex number ... 3. A function to convert a complex number in algebraic form to a complex number in phasor form

Boundary tag system., boundary tag system in data structure? boundary tag system in data structure?