The uniqueness of covers for widely generalized line graphs

Authors Michitaka Furuya, Sho Kubota, Tetsuji Taniguchi, Kiyoto Yoshino

Publication date 19 February 2020

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

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 eigenvalue 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 [Ars Math.~Contemp. extbf{1} (2008) 81--98].

This page was built for publication: The uniqueness of covers for widely generalized line graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6335121)