Abstract
In a previous paper (Mowshowitz, 1968), a measureI g (X) of the structural information content of an (undirected) graphX was defined, and its properties explored. The class of graphs on whichI g is defined is here enlarged to included directed graphs (digraphs). Most of the properties ofI g observed in the undirected case are seen to hold for digraphs. The greater generality of digraphs allows for a construction which shows that there exists a digraph having information content equal to the entropy of an arbitrary partition of a given positive integer.
The measureI g is also extended to a measure defined on infinite (undirected) graphs. The properties of this extension are discussed, and its applicability to the problem of measuring the complexity of algorithms is considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature
Harary, F. 1959. “On the Group of the Composition of two Graphs.”Duke Math. Jour.,26, 29–34.
—, R. Z. Norman and D. Cartwright. 1965.Structural Models. New York: John Wiley and Sons.
Mowshowitz, A. 1968. “Entropy and the Complexity of Graphs: I. An Index of the Relative Complexity of a Graph.”Bull. Math. Biophysics,30, 175–204.
Sabidussi, G. 1959. “The Composition of Graphs.”Duke Math. Jour.,26, 693–696.
— 1960. “Graph Multiplication.”Math. Zeitschrift,72, 446–457.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mowshowitz, A. Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs. Bulletin of Mathematical Biophysics 30, 225–240 (1968). https://doi.org/10.1007/BF02476692
Issue Date:
DOI: https://doi.org/10.1007/BF02476692