Measuring the complexity of directed graphs: A polynomial-based approach
Measuring the complexity of directed graphs: A polynomial-based approach
In this paper, we define novel graph measures for directed networks. The measures are based on graph polynomials utilizing the out- and in-degrees of directed graphs. Based on these polynomial, we define another polynomial and use their positive zeros as graph measures. The measures have meaningful properties that we investigate …