Degree centrality is connections / (n-1). Betweenness is how often a city sits on shortest paths.

Goal

Print Nakuru's scores on a small star-like map.

import networkx as nx
G = nx.Graph([('Nairobi', 'Nakuru'), ('Nakuru', 'Kisumu'), ('Nakuru', 'Eldoret'), ('Nairobi', 'Mombasa')])
print({k: round(v, 3) for k, v in nx.degree_centrality(G).items()})

import networkx as nx
G = nx.Graph([('Nairobi', 'Nakuru'), ('Nakuru', 'Kisumu'), ('Nakuru', 'Eldoret')])
print({k: round(v, 3) for k, v in nx.betweenness_centrality(G).items()})

import networkx as nx
print(nx.degree_centrality(nx.star_graph(4)))

import networkx as nx
print(max(nx.degree_centrality(nx.path_graph(5)).items(), key=lambda kv: kv[1]))