Of Notes

Betweenness centrality of a tree node whose removal splits the tree

1 min read · revised 22 October 2026 · ·

Table of Contents

Problem

Consider a tree of size . Suppose there exists a node of degree , say node 1, such that its removal divides the tree into isolated trees of sizes (). Show that the betweenness centrality of this node is Use this result to derive the betweenness centrality of the nodes in the second graph of Tutorial 1.

Solution

/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card