Abstract
The idea of assigning an information content to a graph is extended to include the following two situations: (a) Combinations of sets of topologically equivalent points are used as symbols; (b) Points of the graph may exist in different states.
Similar content being viewed by others
Literature
Chrystal, G. 1906.Algebra, Part II. 2nd ed. London: Adam, and Charles Black.
Fréchet, M. 1938.Méthode des fonctions arbitraires. Théorie des événements en chaîne dans le cas d'un nombre fini d'états possibles. Paris: Gauthier Villars.
Lunn, A. C. and J. K. Senior. 1929. “Isomerism and Configuration.”J. Phys. Chemistry,33, 1027–79.
Pólya, G. 1937. “Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen.”Acta Mathematica,68, 145–254.
Rapoport, A. 1955. “Application of Information Networks to a Theory of Vision.”Bull. Math. Biophysics,17, 15–33.
Rashevsky, N. 1955a. “Some Theorems in Topology and a Possible Biological Implication.”Bull. Math. Biophysics,17, 111–26.
— 1955b. “Life, Information Theory, and Topology.” Ibid.,,17, 229–35.
Shannon, C. E. and W. Weaver. 1949.The Mathematical Theory of Communication. Urbana: University of Illinois Press.
ter Haar, D. 1954.Elements of Statistical Mechanics. New York: Rinehart & Co.
Trucco, E. 1956. “A Note on the Information Content of Graphs.”Bull. Math. Biophysics,18, 129–35.
Whitworth, W. A. 1925.Choice and Chance. New York: Stechert & Co.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Trucco, E. On the information content of graphs: Compound symbols; Different states for each point. Bulletin of Mathematical Biophysics 18, 237–253 (1956). https://doi.org/10.1007/BF02481859
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02481859