ENTROPY AND COMPLEXITY OF GRAPHS .3. GRAPHS WITH PRESCRIBED INFORMATION CONTENT

The connection between the adjacency matrix and the automorphisms of a digraph is used to develop a method for studying the automorphism group and, thus, the information content (Mowshowitz 1968a, b) of a digraph. An algorithm is given for constructing digraphs with zero information content, and the properties of such digraphs are examined. Moreover, an algorithm for computing the automorphism group of a digraph is presented and is used to find conditions which insure that two digraphs have the same information content. This algorithm is further used to determine the information content of digraphs whose adjacency matrices have prescribed properties. © 1968 N. Rashevsky.