Просмотр кода страницы Strong closure of a graph

'''Strong closure of a graph''' --- сильное замыкание графа. 

The ''' strong closure''' of a graph <math>G</math> is the graph obtained from <math>G</math> by
recursively joining pairs of nonadjacent vertices, whose degree sum is
at least <math>n + 1</math> (<math>n</math> is the number of vertices of <math>G</math>), until no such
pair remains. The ''' strong closure''' of <math>G</math> is denoted by <math>sc(G)</math>. The notion
of a ''' strong closure''' is useful in the study of Hamiltonian graphs.