The four undecided cases in the classification of d-omni-conductors

We settle the four cases left open in the classification of d-omni-conductors by Fowler, Borg, Pickup and Sciriha (Phys. Chem. Chem. Phys. 22 (2020) 1349). The combination CIX with nullity 0 is realised by a graph on 20 vertices and by an infinite family on 18k + 2 vertices. The combinations ICC and IXC with nullity 1, and ICX with nullity greater than 1, are impossible. The classification is then complete, with 36 realisable combinations and 45 impossible ones. We also show that no graph of maximum degree at most 4, and so no chemical graph, has code CIX with nullity 0. This work was carried out with AI language models (Anthropic Claude) under the author's direction. The models selected the problem, wrote the classifier, found the example by a computer search and produced the proofs. The author has no academic training in mathematics. The example was checked by three exact programs, which are attached, and the proofs were read by three AI reviewers that did not take part in producing them, two of them from other providers. No specialist in the area has read this note. The author has not found this result in the literature but cannot rule out prior work.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24184091
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The four undecided cases in the classification of d-omni-conductors

Arturo Abreu
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

The four undecided cases in the classification of d-omni-conductors

Arturo Abreu
preprint en

Abstract

We settle the four cases left open in the classification of d-omni-conductors by Fowler, Borg, Pickup and Sciriha (Phys. Chem. Chem. Phys. 22 (2020) 1349). The combination CIX with nullity 0 is realised by a graph on 20 vertices and by an infinite family on 18k + 2 vertices. The combinations ICC and IXC with nullity 1, and ICX with nullity greater than 1, are impossible. The classification is then complete, with 36 realisable combinations and 45 impossible ones. We also show that no graph of maximum degree at most 4, and so no chemical graph, has code CIX with nullity 0. This work was carried out with AI language models (Anthropic Claude) under the author's direction. The models selected the problem, wrote the classifier, found the example by a computer search and produced the proofs. The author has no academic training in mathematics. The example was checked by three exact programs, which are attached, and the proofs were read by three AI reviewers that did not take part in producing them, two of them from other providers. No specialist in the area has read this note. The author has not found this result in the literature but cannot rule out prior work.

Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon