Ars Mathematica Contemporanea· 2026Q2
The uniqueness of covers of widely generalized line graphs
- 2citations
- Q2SCImago
- 2026year
Short summary
A theorem is proven for the uniqueness of strict covers of Hoffman line graphs, under a condition checkable in finite time.
AI-generated from the title and abstract; the full text is not read.
Key points
- A theorem is presented for the uniqueness of strict covers of Hoffman line graphs.
- The condition for this uniqueness is checkable in finite time.
- The result generalizes and offers a simplified proof for a 2008 finding by Taniguchi.
AI-generated from the title and abstract; the full text is not read.
Abstract
As a natural generalization of line graphs, Hoffman line graphs were defined by Woo and Neumaier. Especially, Hoffman line graphs are closely related to the smallest eigenvalues of graphs, and the uniqueness of strict covers of a Hoffman line graph plays a key role in such a study. In this paper, we prove a theorem for the uniqueness of strict covers under a condition which can be checked in finite time. Our result gives a generalization and a short proof for the main part of Taniguchi's 2008 result on the uniqueness of strict covers.
The authors' abstract, as published at the source. Ars Mathematica Contemporanea, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Geometry and Topology
Geometry and TopologyMathematics