Fat Hoffman graphs with smallest eigenvalue greater than -3

Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

In this paper, we give a combinatorial characterization of the special graphs of fat Hoffman graphs containing K1,2 with smallest eigenvalue greater than -3, where K1,2 is the Hoffman graph having one slim vertex and two fat vertices.

Original languageEnglish
Pages (from-to)78-88
Number of pages11
JournalDiscrete Applied Mathematics
Volume176
DOIs
Publication statusPublished - 2014 Oct 30

Keywords

  • Block graph
  • Graph eigenvalue
  • Line graph
  • Signed graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Fat Hoffman graphs with smallest eigenvalue greater than -3'. Together they form a unique fingerprint.

Cite this