✦ LIBER ✦

Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs

✍ Scribed by Abbe Mowshowitz

Book ID: 112758114
Publisher: Springer
Year: 1968
Tongue: English
Weight: 777 KB
Volume: 30
Category: Article
ISSN: 1522-9602
DOI: 10.1007/bf02476692

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Entropy and the complexity of graphs: IV

Entropy and the complexity of graphs: IV. Entropy measures and graphical structure

✍ Abbe Mowshowitz 📂 Article 📅 1968 🏛 Springer 🌐 English ⚖ 612 KB

Testing the -disconnectivity of graphs a

Testing the -disconnectivity of graphs and digraphs

✍ Yuichi Yoshida; Yusuke Kobayashi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 393 KB

The geodetic numbers of graphs and digra

The geodetic numbers of graphs and digraphs

✍ Chang-hong Lu 📂 Article 📅 2007 🏛 SP Science China Press 🌐 English ⚖ 320 KB

The connectivity of large digraphs and g

The connectivity of large digraphs and graphs

✍ M. A. Fiol 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 632 KB

## Abstract This paper studies the relation between the connectivity and other parameters of a digraph (or graph), namely its order __n__, minimum degree δ, maximum degree Δ, diameter __D__, and a new parameter l~pi;~, __0__ ≤ π ≤ δ − 2, related with the number of short paths (in the case of graphs

The superconnectivity of large digraphs

The superconnectivity of large digraphs and graphs

✍ M.A. Fiol 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 696 KB

On the complexity of the multicut proble

On the complexity of the multicut problem in bounded tree-width graphs and digraphs

✍ Cédric Bentz 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 232 KB