Graph Theory Distance Problem - [Discrete Mathematics]

This video covers an interesting graph theory problem. Graph theory is a part of discrete mathematics that concerns pairwise relationships between objects (represented by vertices and edges, or nodes and links). This video is the 3rd video in my Discrete Mathematics - Graph Theory series. The problem in this video is to find the distance between two vertices in a special type of graph of any number of vertices, and the diameter of this special type of graph of any size. The graph is defined in the video visually. In graph theory, the diameter of a graph is the longest shortest path between any two vertices in the graph, while the distance between two vertices is the number of edges in a shortest path between those two vertices. See my Introduction to Graph Theory video for more information: https://youtu.be/N_tJo3XwY-M

I hope you enjoy the video. Feedback is welcome in the comments as well as any questions you have about the video. Feel free to share the problem with your friends or challenge them to solve the problem in the video :)

If you enjoyed the video, please check out my other videos in the graph theory series: https://www.youtube.com/watch?v=HFP4Br7uvYo and https://www.youtube.com/watch?v=N_tJo3XwY-M

Reddit: https://www.reddit.com/r/Vitalsine/ Discord: https://discord.gg/dvpXxBy

Have a great day! ... https://www.youtube.com/watch?v=nc2kmXKKPOQ