Просмотр кода страницы Pancentral graph

'''Pancentral graph''' --- панцентральный граф. 

A graph <math>G</math> is called ''' pan-unicentral''' if, given a vertex <math>v</math> in
<math>G</math>, there exists a spanning tree <math>T</math> such that <math>C(T) = \{v\}</math>, where
<math>C(T)</math> is the '' center'' of <math>T</math>. <math>G</math> is called ''' pan-bicentral'''
if, given adjacent vertices <math>u</math> and <math>v</math> in <math>G</math>, there exists a
spanning tree <math>T</math> such that <math>C(T) = \{u,v\}</math>. A graph <math>G</math> with both
properties is called ''' pancentral'''.