Новая страница: «'''True twins''' --- истинные близнецы. Two vertices of a graph are called ''' true twins''', when they are adjacent and every other vertex is adja…»
(Новая страница: «'''True twins''' --- истинные близнецы. Two vertices of a graph are called ''' true twins''', when they are adjacent and every other vertex is adja…»)