Digital repository of Slovenian research organisations

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

Title:Nut digraphs
Authors:ID Bašić, Nino (Author)
ID Fowler, Patrick W. (Author)
ID McCarthy, Maxine M. (Author)
ID Potočnik, Primož (Author)
Files:.pdf PDF - Presentation file, download (1,26 MB)
MD5: AE85AB9366AC47B027F64C71307A3E0D
 
URL URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0166218X25007498
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract: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.
Keywords: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
Publication status:Published
Publication version:Version of Record
Publication date:15.04.2026
Year of publishing:2026
Number of pages:str. 203-226
Numbering:Vol. 383
PID:20.500.12556/DiRROS-28058 New window
UDC:519.17
ISSN on article:0166-218X
DOI:10.1016/j.dam.2025.12.037 New window
COBISS.SI-ID:264177411 New window
Note:
Publication date in DiRROS:09.03.2026
Views:252
Downloads:152
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:Discrete applied mathematics
Shortened title:Discrete appl. math.
Publisher:Elsevier
ISSN:0166-218X
COBISS.SI-ID:25342464 New window

Document is financed by a project

Funder:ARRS - Slovenian Research 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:ARRS - Slovenian Research 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:EPSRC - Engineering and Physical Sciences Research Council
Funding programme:Ph.D. studentship
Project number:2482664

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, sredični graf, ničelnost, usmerjeni graf, orešni digraf, desno-orešni, levo-orešni, bi-orešni, ambi-orešni, inter-orešni, desno-sredično vozlišče, levo-sredično vozlišče, spektri grafov


Back