Let me know if you can think of any other interesting properties of graph powers in the comments 👍
@sabinomuniz55422 жыл бұрын
Explained it so simply. Much thanks!
@VitalSine2 жыл бұрын
Thank you, I'm glad the video was helpful!
@rosetta-stxned3 жыл бұрын
puts it so simply. thanks
@VitalSine3 жыл бұрын
You're welcome, glad you liked the video :)
@VitalSine Жыл бұрын
0:00 Definition of Graph Power 6:00 Example 1 7:39 Diameter and Graph Powers
@marianaaa242 жыл бұрын
this video is a life SAVER thank you!!!
@VitalSine2 жыл бұрын
I'm glad it was helpful!
@darrenfinch19352 жыл бұрын
Very simple explanation thanks so much!
@VitalSine2 жыл бұрын
You're very welcome 👍
@yuezhouliu9278 Жыл бұрын
Nice video! Are there any properties that relate the adjacency matrices of G and its graph power G^k?
@VitalSine Жыл бұрын
Thank you! If A is the adjacency matrix of G, then the adjacency matrix of G^k can be found by changing all nonzero entries in A^k to 1.
@YOURFRIENDMATHEMATICS3 жыл бұрын
Nice video.
@VitalSine3 жыл бұрын
Thank you! Glad you liked it :)
@rafaelarvexm.sancho9823 Жыл бұрын
Is it the same in getting the Adjacency matrix of A(G^k) in the power of adjacency matrix of G (A^k(G))? Thank you!
@VitalSine Жыл бұрын
Hello, I thought I had responded to this before but just saw that it was left without a reply, sorry about that. The adjacency matrix A(G^k) will be the adjacency matrix (A(G))^k, where all nonzero entries are replaced with 1s.
@OracleOfSages2 жыл бұрын
How do you find G4? And I’m not talking about a relation with just straight bridges.
@VitalSine2 жыл бұрын
Excellent question. One approach would be to take the sum of the first four powers of the adjacency matrix, A, of your graph. Let B = A^1 + A^2 + A^3 + A^4. Zero the diagonal entries. Then two vertices, i and k in G4 are adjacent if and only if B(i, k) is nonzero.