• Latest version: qgraf-r-1.0 (2019)
  Please report any error you may happen to find.

• Programming language: Fortran 77
  No binaries either (see also the corresponding entry for Qgraf).

Most of the theory behind Qgraf–r is described in these papers:

• From Feynman rules to conserved quantum numbers, I
  Comput. Phys. Commun. 214 (2017) 83–90
  https://doi.org/10.1016/j.cpc.2017.01.025
  

  ▻ show outline

  ▻ hide

  Paper I shows that there are efficient algorithms for computing the (particle) number conservation rules of a QFT model — more precisely, for computing a complete system of those rules. In particular, it shows how that system follows directly from the simple, combinatorial requirement that the Feynman diagrams must be built up from the vertices and free-particle propagators of the model.

• From Feynman rules to conserved quantum numbers, II
  Comput. Phys. Commun. 215 (2017) 13–19
  https://doi.org/10.1016/j.cpc.2017.01.027
  

  ▻ show outline

  ▻ hide

  Paper II shows how the form of pairing graph (a graph that describes the propagator types of the respective model), and specifically the (non-)bipartiteness of its connected components, may impose nontrivial constraints on the form of the (particle) number conservation rules (eg on whether additive charges exist). In addition, it shows that the algorithms described in paper I can often be improved.

• From Feynman rules to conserved quantum numbers, III
  Comput. Phys. Commun. 260 (2021) 107740
  https://doi.org/10.1016/j.cpc.2020.107740
  

  ▻ show outline

  ▻ hide

  Paper III proves the following: for ‘most’ of the common QFT models, there exist Feynman diagrams for a complete correlation function ⟨ F ⟩ if and only if ⟨ F ⟩ is compatible with the particle number conservation rules (the nontrivial part being the sufficiency of that condition). The general form of those rules for the usual type of QFT models (ie without explicit propagator mixing) is also presented.