scientific article; zbMATH DE number 4012647

From MaRDI portal
Publication:3762341





[For the entire collection see Zbl 0601.00003.] In connection with determining the amount of relative information contained in orientations of a graph a determinant, called the information polynomial, arises. The authors evaluate this polynomial in terms of subgraphs and obtain a recurrence relation for a certain function involving this polynomial in case the graph is a tree.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762341)