Graph Theory: 56. Central Vertices are in a Single Block
Recall that a block in a graph is a maximal nonseparable subgraph, and the centre of a graph is the set of all vertices whose eccentricity is equal to the radius (minimum eccentricity). In this video we walk through a proof that the centre of every connected graph lies in a single block of the graph. The proof method is by contradiction.
-- Bits of Graph Theory by Dr. Sarada Herke.
Related videos:
• Graph Theory: 55. Bridges and Blocks - GT 55: Bridges and Blocks
• Graph Theory: 53. Cut-Vertices - GT 53: Cut-Vertices
• Graph Theory: 51. Eccentricity, Radius & D... - GT 51: Eccentricity, Radius & Diameter
• Graph Theory: 50. Maximum vs Maximal - GT 50: Maximum vs Maximal
For quick videos about Math tips and useful facts, check out my other channel
"Spoonful of Maths" - / spoonfulofmaths