Primary Non-QE Graphs on Six Vertices
Combinatorics
2023-07-24 v3
Abstract
A connected graph is called of non-QE class if it does not admit a quadratic embedding in a Euclidean space. A non-QE graph is called primary if it does not contain a non-QE graph as an isometrically embedded proper subgraph. The graphs on six vertices are completely classified into the classes of QE graphs, of non-QE graphs, and of primary non-QE graphs.
Keywords
Cite
@article{arxiv.2207.13278,
title = {Primary Non-QE Graphs on Six Vertices},
author = {Nobuaki Obata},
journal= {arXiv preprint arXiv:2207.13278},
year = {2023}
}
Comments
arXiv admin note: text overlap with arXiv:2206.05848