✦ LIBER ✦

Matchings, covers, and Jacobian matrices

✍ Scribed by Manfred Gilli; Myriam Garbely

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 948 KB
Volume: 20
Category: Article
ISSN: 0165-1889
DOI: 10.1016/0165-1889(95)00910-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matchings and cycle covers in random dig

Matchings and cycle covers in random digraphs

✍ John Gimbel; E.M. Palmer 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 407 KB

Exponential formulas for the Jacobians a

Exponential formulas for the Jacobians and Jacobian matrices of analytic maps

✍ Wenhua Zhao 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Reliability, covering and balanced matri

Reliability, covering and balanced matrices

✍ Michael O. Ball; Feng L. Lin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 489 KB

Total matchings and total coverings of g

Total matchings and total coverings of graphs

✍ Y. Alavi; M. Behzad; L. M. Lesniak-Foster; E. A. Nordhaus 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

## Abstract In graph theory, the related problems of deciding when a set of vertices or a set of edges constitutes a maximum matching or a minimum covering have been extensively studied. In this paper we generalize these ideas by defining total matchings and total coverings, and show that these set

On total covering and matching of graphs

✍ A Meir 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Doubly stochastic matrices and dicycle c

Doubly stochastic matrices and dicycle covers and packings in eulerian digraphs

✍ Alberto Borobia; Zeev Nutov; Michal Penn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 671 KB