tonamatos / balanceablegraphs

Recursive formulas for constant balancing numbers.

Balanceable Graphs

About

Formulas for recursively computing the balancing number of all graphs of constant balancing number. Algorithms can be expanded to find balanced copies in given graphs in quadratic time.

This program was developed by

• Tonatiuh Matos Wiederhold
  Dept. of Mathematics, University of Toronto, Canada.
  [email protected]

Based on the research of [1], below.

References

[1] Caro, Y., González, I., Hansberg, A., Jácome, M., _, A. Montejano, Graphs with constant balancing number, Procedia Computer Science, 2023.