The uniqueness of covers of widely generalized line graphs

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.

Authors

Institutions

Publication Details

Journal
Ars Mathematica Contemporanea
Published
2026-10-05
DOI
https://doi.org/10.26493/1855-3974.3159.dc3
Citations
2
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The uniqueness of covers of widely generalized line graphs

Kiyoto Yoshino, Tetsuji Taniguchi, Michitaka Furuya, Sho Kubota
2 citations
Ars Mathematica Contemporanea
Graph theory and applications
article

The uniqueness of covers of widely generalized line graphs

Kiyoto Yoshino, Tetsuji Taniguchi, Michitaka Furuya, Sho Kubota
article en
2 citations

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.

Ars Mathematica Contemporanea
Hiroshima Institute of Technology (JP), Kitasato University (JP), Osaka Institute of Technology (JP)
Japan Society for the Promotion of Science
Openalex Percentile: Top 100%
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.