Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:Nut graphs with a prescribed number of vertex and edge orbits
Authors:ID Bašić, Nino (Author)
ID Damnjanović, Ivan (Author)
Files:.pdf PDF - Presentation file, download (462,33 KB)
MD5: AA88E1A10F65A5BCBFA54FC6FF6E05FD
 
URL URL - Source URL, visit https://link.springer.com/article/10.1007/s10801-025-01492-6
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract: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.
Keywords:nut graph, vertex orbit, edge orbit, arc orbit, Cayley graph, automorphism
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2026
Year of publishing:2026
Number of pages:str. 1-12
Numbering:Vol. 63, iss. 1, article no. 9
PID:20.500.12556/DiRROS-28055 New window
UDC:519.17
ISSN on article:0925-9899
DOI:10.1007/s10801-025-01492-6 New window
COBISS.SI-ID:264172035 New window
Publication date in DiRROS:09.03.2026
Views:240
Downloads:136
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
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:Springer Nature
ISSN:0925-9899
COBISS.SI-ID:2713689 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0294
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:J5-4596
Name:Višjestopenjske bibliografske storitve

Funder:Other - Other funder or multiple funders
Project number:3350-23-3505
Name:Development of basic computer science and information technology content and skills in kindergartens and primary schools
Acronym:B-RIN

Funder:Ministry of Science, Technological Development and Innovation of the Republic of Serbia
Project number:451-03-137/2025-03/200102

Funder:Science Fund of the Republic of Serbia
Project number:6767
Name:Lazy walk counts and spectral radius of threshold graphs
Acronym:LZWK

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, orbita vozlišč, orbita povezav, orbita lokov, Cayleyjev graf, avtomorfizem


Back