✦ LIBER ✦

Average distances in undirected graphs and the removal of vertices

✍ Scribed by Ingo Althöfer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum Augmentation of Edge-Connectivit

✍ Toshimasa Ishii; Yoko Akiyama; Hiroshi Nagamochi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 805 KB

On the independence number of distance g

✍ A. É. Guterman; V. K. Lyubimov; A. M. Raigorodskii; S. A. Usachev 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 522 KB

The computation of the distance matrix a

✍ Peter Senn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 952 KB

New lower bounds for the independence nu

✍ V. F. Moskva; A. M. Raigorodskii 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 504 KB

Simple enumeration of minimal cutsets se

📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 137 KB

A new family of distance-regular graphs

✍ Joe Hemmeter; Andries Brouwer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 743 KB