Related Experiment Video
Updated: Jan 3, 2026

Soft Pneumatic Robot Modulates Graph Theory Metrics of Brain Network for Hand Rehabilitation After Stroke
Published on: October 10, 2025
Measuring the complexity of directed graphs: A polynomial-based approach
Matthias Dehmer1,2,3, Zengqiang Chen2, Frank Emmert-Streib4,5
1Institute for Intelligent Production, Faculty for Management, University of Applied Sciences Upper Austria, Steyr, Austria.
Abstract:
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 based on analytical and numerical results. As the computational complexity to compute the measures is polynomial, our approach is efficient and can be applied to large networks. We emphasize that our approach clearly complements the literature in this field as, to the best of our knowledge, existing complexity measures for directed graphs have never been applied on a large scale.
More Related Videos
Related Concept Videos
Introduction to Polynomial Functions
Fundamental Theorem of Algebra
Graphs of Polar Equations
Synthetic Disvision of Polynomials
Complex Zeros
Graphs of Equations in Two Variables

