Of Notes

Closeness centralities of the two ends of a tree edge

1 min read · revised 22 October 2026 · ·

Table of Contents

Problem

Consider the tree in the figure. The edge connecting node 1 to node 2 divides the tree into two disjoint regions containing and nodes, respectively (with ).

A tree containing an edge connecting two disjoint regions of size \(N_1\) and \(N_2\).
Fig. 1. A tree containing an edge connecting two disjoint regions of size and .

Show that the closeness centrality of node 1 is related to the closeness centrality of node 2 by

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