✦ LIBER ✦

On the number of irreducible covers of a graph by edges

✍ Scribed by R. G. Nigmatullin

Publisher: Springer US
Year: 1973
Tongue: English
Weight: 285 KB
Volume: 6
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01070509

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of irreducible coverings b

On the number of irreducible coverings by edges of complete bipartite graphs

✍ Ioan Tomescu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 102 KB

In this paper it is proved that the exponential generating function of the numbers, denoted by N(p, q), of irreducible coverings by edges of the vertices of complete bipartite graphs Kp.q equals exp(xe r + ye x -x -y -xy) -t.

Upper bounds on the edge clique cover nu

Upper bounds on the edge clique cover number of a graph

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

The generating function of irreducible c

The generating function of irreducible coverings by edges of complete k-partite graphs

✍ Virgil Domocos; Ş.N. Buzeţeanu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A generalization of a recent result of Tomescu ( 1993) is presented. The method is purely combinatorial and is based on the theory of species of several variables.

The minimum number of triangles covering

The minimum number of triangles covering the edges of a graph

✍ Jenö Lehel 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 703 KB

The vertex (edge) independence number, v

The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph

✍ Ying-Ying Tan; Yi-Zheng Fan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 151 KB

Covering the edges of a graph by circuit

Covering the edges of a graph by circuits

✍ D. Ya. Kesel'man 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 847 KB