Nut digraphsBašić, Nino (Avtor) Fowler, Patrick W. (Avtor) McCarthy, Maxine M. (Avtor) Potočnik, Primož (Avtor) nut graphcore graphnullitydirected graphnut digraphdextro-nutlaevo-nutbi-nutambi-nutinter-nutdextro-core vertexlaevo-core vertexgraph spectraA nut graph is a simple graph whose kernel is spanned by a single full vector (i.e., the adjacency matrix has a single zero eigenvalue and all non-zero kernel eigenvectors have no zero entry). We classify generalisations of nut graphs to nut digraphs: a digraph whose kernel (resp. co-kernel) is spanned by a full vector is dextro-nut (resp. laevo-nut); a bi-nut digraph is both laevo- and dextro-nut; an ambi-nut digraph is a bi-nut digraph where kernel and co-kernel are spanned by the same vector; a digraph is inter-nut if the intersection of the kernel and co-kernel is spanned by a full vector. It is known that a nut graph is connected, leafless and non-bipartite. It is shown here that an ambi-nut digraph is strongly connected, non-bipartite (i.e., has a non-bipartite underlying graph) and has minimum in-degree and minimum out-degree of at least 2. Refined notions of core and core-forbidden vertices apply to singular digraphs. Infinite families of nut digraphs and systematic coalescence, crossover and multiplier constructions are introduced. Relevance of nut digraphs to topological physics is discussed.20262026-01-09 15:49:21Neznano22450UDK: 519.17ISSN pri članku: 0166-218XDOI: 10.1016/j.dam.2025.12.037COBISS.SI-ID: 264177411sl