Question: a graph g is called selfcentered if cg v...
Question details
A graph G is called self-centered if C(G) = V (G). Prove that
every complete
bipartite graph, every cycle, and every complete graph is
self-centered
Solution by an expert tutor

A graph G is called self-centered if C(G) = V (G). Prove that
every complete
bipartite graph, every cycle, and every complete graph is
self-centered