OpenAlex ·

Det-extremal cubic graphs and the total domatic number

Myungho Choi, Hyemin Kwon and Boram Park

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.33902
Original
Read it at the publisher
Topics
Computational ComplexityCombinatorics

Abstract

A graph $G$ is det-extremal if $|\operatorname{det} A|=\operatorname{per} A$ for its adjacency matrix $A$. Det-extremal cubic bipartite graphs arise in the study of Pólya's permanent problem, and McCuaig characterized the $3$-connected ones as vertex-sums of copies of the Heawood graph. The total domatic number of a graph is the largest number of pairwise disjoint total dominating sets. Characterization of the cubic graphs with total domatic number $1$ has been a long-standing open problem. In this paper, we prove that a connected cubic graph is det-extremal if and only if its total domatic number is $1$. We further show that McCuaig's characterization extends to all $3$-connected cubic graphs, and that every connected det-extremal cubic graph has girth $3$, $5$ or $6$. We also prove that a connected det-extremal cubic non-bipartite graph has at least $28$ vertices, and that this bound is best possible. Through this correspondence, these results carry over to cubic graphs with total domatic number $1$. In addition, in the language of configurations, our results imply that every triangle-free $3$-configuration has a blocking set.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Computational Complexity

Get the few papers worth your time in Computational Complexity every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics