Question

1) Find the adjacency matrix A of the graph G
2) Find the matrix giving the number of 3 step walks in G.
3) Find the generating function for walks from point i to j.
4) Find the generating function for walks from points 1 to 3.

Answer 1

The adjacency matrix L encodes the graph. The entry Lij is equal to k if there are k connections between node i and j. Otherwise, the entry is zero. Problem 2 asks to find the matrix which encodes all possible paths of length 3. Generating function. To a graph one can assign for pair of nodes i,j a series f(z) = \sum_{n=0}^{\infty} a_n^(ij) zⁿ, where an(ij) is the number of walks from i to j with n steps. Problem 3) asks for a formula for f(z) and in problem 4) an explicit expression in the case i=1,j=3.

Answer 2

ill help

Answer 3

ok

Answer 4

but plz change pic not 2 be rude but i just dont like him i dont hate him just not a fan

Answer 5

ill change it to what ever you want if you can hellp

Answer 6

ok want do u think 1st

Answer 7

idk

Answer 8

i think it 3.5

Answer 9

that dosent even make sense

Answer 10

btw heres the pic

Answer 11

hold on jk about awnser hay flower girl

Answer 12

wow

Answer 13

@pooja195

Answer 14

@Koikkara