20.500.12556/RUP-22142 Nut graphs with a given automorphism group 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. nut graph graph automorphism automorphism group nullity graph spectra f-universal orešni graf avtomorfizem grafa grupa avtomorfizmov ničelnost spekter grafa f-univerzalen true false true Angleški jezik Slovenski jezik Članek v reviji 2025-11-25 08:54:29 2025-11-25 08:54:32 2025-11-26 03:03:23 0000-00-00 00:00:00 2025 0 0 str. 1-12 iss. 2, article no. 17 Vol. 61 Mar. 2025 0000-00-00 Zaloznikova NiDoloceno NiDoloceno 0000-00-00 0000-00-00 2025-02-18 519.17 0925-9899 10.1007/s10801-025-01389-4 258553859 RAZ_Basic_Nino_2025.pdf RAZ_Basic_Nino_2025.pdf 1 0689C86F9DF15A4118CA74E026C4099F 2f7ebd95725348bbd20e0a24e30ab8d9c560b0c298e5bd2501b8ddf63560f5d9 5d2c5892-c9d4-11f0-8f0b-005056ac49c0 https://repozitorij.upr.si/Dokument.php?lang=slv&id=32129 https://link.springer.com/article/10.1007/s10801-025-01389-4 1 3c609b9d-c9d4-11f0-8f0b-005056ac49c0 https://repozitorij.upr.si/Dokument.php?lang=slv&id=32128 Fakulteta za matematiko, naravoslovje in informacijske tehnologije 0 0 0