OFFSET
1,2
COMMENTS
Edges are undirected, vertices not labeled. "Fairly" means that each vertex has degree 4, but two of these edges do not connect to a second vertex; they are "fins" in CAD speak or "half-edges" in perturbation theory. The two fins may be attached to the same or to two different nodes. In the usual mathematical nomenclature these are connected graphs of order n+2 with two vertices of degree 1 and n vertices of degree 4, loops allowed.
LINKS
H. Kleinert, A. Pelster, B. Kastening, and M. Bachmann, Recursive graphical construction of Feynman diagrams and their multiplicities in Phi^4 and Phi^2*A theory, Phys. Rev. E 62 (2) (2000), 1537 Table II.
R. J. Mathar, Illustrations
CROSSREFS
KEYWORD
nonn,hard
AUTHOR
R. J. Mathar, Mar 02 2023
EXTENSIONS
Terms a(7) and beyond from Andrew Howroyd, Mar 05 2023
STATUS
approved