Skip to content

Latest commit

 

History

History
20 lines (13 loc) · 990 Bytes

README.md

File metadata and controls

20 lines (13 loc) · 990 Bytes

qf

A package related to building quasi-fibration symmetries of graphs.

If you'd like to learn more about how it works, see the brief explanation and References below.

Brought to you by Paolo Boldi ([email protected]).

Read the full documentation for more information.

References

  • Boldi, Paolo, and Sebastiano Vigna. Fibrations of graphs. Discrete Mathematics 243.1-3 (2002): 21-66.
  • Leifer, Ian, et al. Circuits with broken fibration symmetries perform core logic computations in biological networks. PLoS computational biology 16.6 (2020): e1007776.
  • Golubitsky, Martin, and Ian Stewart. Nonlinear dynamics of networks: the groupoid formalism. Bulletin of the american mathematical society 43.3 (2006): 305-364.