Quantum factor graphs

Equimatchable factor-critical graphs

✍ Odile Favaron 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 423 KB

A simple graph G(X, €1 is factor-critical if the induced subgraph (Xx ) admits a perfect matching for every vertex x of G. It is equimatchable if every maximal matching of G is maximum. The equimatchable non-factor-critical graphs have been studied by Lesk, Plummer, and Pulleyblank. In this paper, w

Factor domination in graphs

✍ Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 656 KB

Given a factoring of a graph, the factor domination number yr is the smallest number of nodes which dominate all factors. General results, mainly involving bounds on yr for factoring of arbitrary graphs, are presented, and some of these are generalizations of well known relationships. The special c

Quantum Tunneling on Graphs

✍ Yong Lin; Gábor Lippner; Shing-Tung Yau 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 256 KB

Equivalent factor matroids of graphs

✍ D. K. Wagner 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 294 KB

Spectral Determinant on Quantum Graphs

✍ Eric Akkermans; Alain Comtet; Jean Desbois; Gilles Montambaux; Christophe Texier 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 454 KB

We study the spectral determinant of the Laplacian on finite graphs characterized by their number of vertices V and bonds B. We present a path integral derivation which leads to two equivalent expressions of the spectral determinant of the Laplacian in terms of either a V\_V vertex matrix or a 2B\_2

Quantum Field Theory || Feynman Graphs

✍ Huang, Kerson 📂 Article 📅 1998 🏛 Wiley-VCH Verlag GmbH 🌐 English ⚖ 770 KB

Quantum field theory is frequently approached from the perspective of particle physics. This book adopts a more general point of view and includes applications of condensed matter physics. Written by a highly respected writer and researcher, it first develops traditional concepts, including Feynman