Classes of digraph structures corresponding to characteristic polynomials

Abstract

This paper introduces the first classification of digraph structures corresponding to characteristic polynomials. It was found that digraph structures created can be divided into three classes with different feasibility for different polynomials—only structures of one class are found to be independent from wages of polynomial’s terms. In this paper classification of structures is described, along with method how to divide them and illustrated with examples.