Lupa

Show document Help

A- | A+ | Print
Title:Nut graphs with a given automorphism group
Authors:ID Bašić, Nino (Author)
ID Fowler, Patrick W. (Author)
Files:.pdf RAZ_Basic_Nino_2025.pdf (526,71 KB)
MD5: 0689C86F9DF15A4118CA74E026C4099F
 
URL https://link.springer.com/article/10.1007/s10801-025-01389-4
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FAMNIT - Faculty of Mathematics, Science and Information Technologies
Abstract: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.
Keywords:nut graph, graph automorphism, automorphism group, nullity, graph spectra, f-universal
Publication version:Version of Record
Publication date:18.02.2025
Year of publishing:2025
Number of pages:str. 1-12
Numbering:Vol. 61, iss. 2, article no. 17
PID:20.500.12556/RUP-22142 This link opens in a new window
UDC:519.17
ISSN on article:0925-9899
DOI:10.1007/s10801-025-01389-4 This link opens in a new window
COBISS.SI-ID:258553859 This link opens in a new window
Publication date in RUP:25.11.2025
Views:372
Downloads:4
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Journal of algebraic combinatorics
Shortened title:J. algebr. comb.
Publisher:Kluwer Academic
ISSN:0925-9899
COBISS.SI-ID:2713689 This link opens in a new window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0294-2020
Name:Računsko intenzivne metode v teoretičnem računalništvu, diskretni matematiki, kombinatorični optimizaciji ter numerični analizi in algebri z uporabo v naravoslovju in družboslovju

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0140-2020
Name:Geometrije, grafi, grupe in povezave med njimi

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-2481-2020
Name:Matematične in računske metode za samosestavljanje poliedrov

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Keywords:orešni graf, avtomorfizem grafa, grupa avtomorfizmov, ničelnost, spekter grafa, f-univerzalen


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica