✦ LIBER ✦

A new combinatorial feature of Feynman graphs

✍ Scribed by Alladi Ramakrishnan; I.V.V Raghavacharyulu

Publisher: Elsevier Science
Year: 1967
Tongue: English
Weight: 295 KB
Volume: 18
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(67)90190-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A study of singularities of non-relativi

A study of singularities of non-relativistic Feynman graphs

✍ L.D. Blokhintsev; A.N. Safronov 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 807 KB

Combinatorial algorithms on a class of g

Combinatorial algorithms on a class of graphs

✍ N.M. Korneyenko 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 200 KB

A new approach to solving three combinat

A new approach to solving three combinatorial enumeration problems on planar graphs

✍ Charles J. Colbourn; J.Scott Provan; Dirk Vertigan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 719 KB

The evaluation of Feynman graphs for a (

The evaluation of Feynman graphs for a (2+1)-dimensional nonrelativistic electron gas

✍ R. Sinclair 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 656 KB

Two-loop nonrelativistic Feynman graphs from many-body physics at zero temperature in 2 + 1 dimensions are evaluated using a combination of symbolic and numerical methods, reducing error, and allowing a greater choice of which numerical methods are in fact applied. The functions to be integrated num

New promotional feature of AJP

✍ Paul A. Garber 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 25 KB

Skeletal graphs — a new class of perfect

Skeletal graphs — a new class of perfect graphs

✍ A. Hertz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Let S be an arbitrary collection of stars in a graph G such that there is no chain of length ~3 joining the centers of (any) two stars in G. We consider the graphs that can be obtained by deleting in a parity graph all the edges of such a set S. These graphs will be called skeletal graphs and we pro