1. Nut digraphsNino Bašić, Patrick W. Fowler, Maxine M. McCarthy, Primož Potočnik, 2026, izvirni znanstveni članek Opis: A 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.
Ključne besede: nut graph, core graph, nullity, directed graph, nut digraph, dextro-nut, laevo-nut, bi-nut, ambi-nut, inter-nut, dextro-core vertex, laevo-core vertex, graph spectra
Objavljeno v RUP: 09.01.2026; Ogledov: 152; Prenosov: 3
 Celotno besedilo (873,25 KB)
Gradivo ima več datotek! Več... |
2. Nut graphs with a prescribed number of vertex and edge orbitsNino Bašić, Ivan Damnjanović, 2026, izvirni znanstveni članek Opis: A nut graph is a nontrivial graph whose adjacency matrix has a one-dimensional null space spanned by a vector without zero entries. Recently, it was shown that a nut graph has more edge orbits than vertex orbits. It was also shown that for any even $r \geq 2$ and any $k \geq r + 1$, there exist infinitely many nut graphs with r vertex orbits and k edge orbits. Here, we extend this result by finding all the pairs $(r, k)$ for which there exists a nut graph with $r$ vertex orbits and $k$ edge orbits. In particular, we show that for any $k \geq 2$, there are infinitely many Cayley nut graphs with $k$ edge orbits and $k$ arc orbits.
Ključne besede: nut graph, vertex orbit, edge orbit, arc orbit, Cayley graph, automorphism
Objavljeno v RUP: 09.01.2026; Ogledov: 171; Prenosov: 5
Celotno besedilo (445,35 KB)
Gradivo ima več datotek! Več... |
3. Nut graphs with a given automorphism groupNino Bašić, Patrick W. Fowler, 2025, izvirni znanstveni članek Opis: A nut graph is a simple graph of order 2 or more for which the adjacency matrix has a single zero eigenvalue such that all nonzero kernel eigenvectors have no zero entry (i.e. are full). It is shown by construction that every finite group can be represented as the group of automorphisms of infinitely many nut graphs. It is further shown that such nut graphs exist even within the class of regular graphs; the cases where the degree is 8, 12, 16, 20 or 24 are realised explicitly.
Ključne besede: nut graph, graph automorphism, automorphism group, nullity, graph spectra, f-universal
Objavljeno v RUP: 25.11.2025; Ogledov: 433; Prenosov: 4
Celotno besedilo (526,71 KB)
Gradivo ima več datotek! Več... |
4. On cubic polycirculant nut graphsNino Bašić, Ivan Damnjanović, 2025, izvirni znanstveni članek Opis: A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\ell$-circulant graph is a graph that admits a cyclic group of automorphisms having $\ell$ vertex orbits of equal size. It is not difficult to observe that there exists no cubic $1$-circulant nut graph or cubic $2$-circulant nut graph, while the full classification of all the cubic $3$-circulant nut graphs was recently obtained (Damnjanović et al. in Electron. J. Comb. 31(2):P2.31, 2024). Here, we investigate the existence of cubic $\ell$-circulant nut graphs for $\ell \geq 4$ and show that there is no cubic $4$-circulant nut graph or cubic $5$-circulant nut graph by using a computer-assisted proof. Furthermore, we rely on a construction based approach in order to demonstrate that there exist infinitely many cubic $\ell$-circulant nut graphs for any fixed $\ell \in \{6, 7\}$ or $\ell \geq 9$.
Ključne besede: nut graph, polycirculant graph, cubic graph, pregraph, voltage graph
Objavljeno v RUP: 19.11.2025; Ogledov: 265; Prenosov: 5
Celotno besedilo (581,83 KB)
Gradivo ima več datotek! Več... |
5. |
6. |
