• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Working paper

О мере сбалансированности полных знаковых графов

We consider measure of the balancedness of the complete signed graph. By definition of this measure it can take values from 0 to 1. But it turns out that its lower bound is strictly greater than 0. This paper presents some evaluations for the minimum measures of balancedness and an algorithm to compute it. The calculation results are compared with data on the balancedness of the Russian Parliament. And at last we formulate a hypothesis about the "minimally balanced" graph and it's measure of the balancedness.