✦ LIBER ✦

Equity trees and graphs via information theory

✍ Scribed by M. Harré; T. Bossomaier

Book ID: 111623249
Publisher: Springer
Year: 2009
Tongue: English
Weight: 902 KB
Volume: 73
Category: Article
ISSN: 1434-6036
DOI: 10.1140/epjb/e2009-00419-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar Graphs, via Well-Orderly Maps and

Planar Graphs, via Well-Orderly Maps and Trees

✍ Nicolas Bonichon; Cyril Gavoille; Nicolas Hanusse; Dominique Poulalhon; Gilles S 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 256 KB

Graph theory, evolutionary trees and cla

Graph theory, evolutionary trees and classification

✍ DAVID PENNY 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 943 KB

Maximum matchings in bipartite graphs vi

Maximum matchings in bipartite graphs via strong spanning trees

✍ M. L. Balinski; J. Gonzalez 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 692 KB

Extremal theory and bipartite graph-tree

Extremal theory and bipartite graph-tree Ramsey numbers

✍ P. Erd'́os; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 675 KB

For a positive integer n and graph E, fs(n) is the least integer m such that any graph of order n and minimal degree m has a copy of B. It will be show that if B is a bipartite graph with parts of order k and 1 (k G I), then there exists a positive constant c, such that for any tree T,, of order II

Chip-firing games, potential theory on g

Chip-firing games, potential theory on graphs, and spanning trees

✍ Baker, Matthew; Shokrieh, Farbod 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Determinant Inequalities via Information

Determinant Inequalities via Information Theory

✍ Cover, Thomas M.; Thomas, A. 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 729 KB