Entropy and the complexity of graphs: III. Graphs with prescribed information content
- 1 September 1968
- journal article
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 30 (3) , 387-414
- https://doi.org/10.1007/bf02476603
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphsBulletin of Mathematical Biology, 1968
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graphBulletin of Mathematical Biology, 1968
- On groups and graphsTransactions of the American Mathematical Society, 1965
- On a theorem of SabidussiProceedings of the American Mathematical Society, 1964
- On the product of directed graphsProceedings of the American Mathematical Society, 1963
- On the Polynomial of a GraphThe American Mathematical Monthly, 1963
- The Kronecker product of graphsProceedings of the American Mathematical Society, 1962
- Spektren endlicher grafenAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1957
- Graphs with Given Group and Given Graph-Theoretical PropertiesCanadian Journal of Mathematics, 1957
- Graphs of Degree Three with a Given Abstract GroupCanadian Journal of Mathematics, 1949