• Hello Guest! Did you know that ProjectKorra has an official Discord server? A lot of discussion about the official server, development process, and community discussion happens over there. Feel free to join now by clicking the link below.

    Join the Discord Server

[Meta] Community assistance!

V

Vidcom

SkitzCrafter said:
- How do you know so much?
- Why do you know so much?
- Are you in college?
- How are you the age that you are, and why are you the age that you are? (TeeHee)
- Why do I find your smartness so sexy? @Vidcom (Lel JK :p)
- Why am I asking the questions that I'm asking? o. O
- If you're 25 Years old, are you married? x3


hehe, most of these are jokes x3
Click to expand...
I read a lot
Because
Not yet
Because I was born at a given time, answers both
Because of my dashing appeal ;)
Because you have nothing better to do in this futile existence
I'm not really 25, I just make a point of not telling people my real age. Also, not married.
 
Finn_Bueno_

Finn_Bueno_

Staff member
Plugin Developer
Verified Member
Did I seriously made a typo ? >,<
FORGIVE ME ALMIGHTY VIDCOM.
But yea, it's 9, 2 , 2.
 
Last edited:
Sketz

Sketz

Verified Member
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.
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
, 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.






I do not take any credit for anything in this post.
 
Simplicitee

Simplicitee

Staff member
Plugin Developer
Verified Member
SkitzCrafter said:
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.
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
, 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.






I do not take any credit for anything in this post.
Click to expand...
Squirrels. That's the answer.
 
HydroMan

HydroMan

Verified Member
SkitzCrafter said:
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.
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
, 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.






I do not take any credit for anything in this post.
Click to expand...
I smell something...like illuminatish '_'
 
You must log in or register to reply here.
Top