Fat Hoffman graphs with smallest eigenvalue greater than -3

DOI10.1016/J.DAM.2014.01.008MaRDI QIDQ403567zbMATH OpenOpenAlexFDO

Authors Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi

Publication date 29 August 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1211.3929

zbMATH Keywords

line graphsigned graphblock graphgraph eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76) Graph designs and isomorphic decomposition (05C51)

Abstract: In this paper, we give a combinatorial characterization of the special graphs of fat Hoffman graphs containing $mathfrak{K}_{1,2}$ with smallest eigenvalue greater than -3, where $mathfrak{K}_{1,2}$ is the Hoffman graph having one slim vertex and two fat vertices.

Recommendations

• On fat Hoffman graphs with smallest eigenvalue at least -3
• Fat Hoffman graphs with smallest eigenvalue at least \(-1 - \tau\)
• On fat Hoffman graphs with smallest eigenvalue at least \(-3\). II
• On graphs with the smallest eigenvalue at least \(-1 - \sqrt{2} \). III
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• On graphs with smallest eigenvalue at least \(-3\) and their lattices
• Graphs with least eigenvalue at least \(-\sqrt3\)
• On graphs with at least three distance eigenvalues less than \(-1\)
• Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
• On graphs whose least eigenvalue is greater than –2

Cites work

• scientific article; zbMATH DE number 4042205 (Why is no real title available?)
• scientific article; zbMATH DE number 3695248 (Why is no real title available?)
• scientific article; zbMATH DE number 2117218 (Why is no real title available?)
• A Characterization of Block-Graphs
• Distance-hereditary graphs
• Fat Hoffman graphs with smallest eigenvalue at least \(-1 - \tau\)
• Line graphs, root systems, and elliptic geometry
• On fat Hoffman graphs with smallest eigenvalue at least -3
• On graphs whose least eigenvalue exceeds -1-2
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• On graphs with the smallest eigenvalue at least −1 − √2, part I
• On spectral characterization and embeddings of graphs
• On the limit points of the smallest eigenvalues of regular graphs
• The Change in the Least Eigenvalued of the Adjacency Matrix of a Graph Under Imbedding

Cited in

(9)

• A generalization of a theorem of Hoffman
• Edge-signed graphs with smallest eigenvalue greater than \(-2\)
• On fat Hoffman graphs with smallest eigenvalue at least \(-3\). II
• Fat Hoffman graphs with smallest eigenvalue at least \(-1 - \tau\)
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• Strongly regular graphs with Hoffman's condition
• Amply regular graphs with Hoffman's condition
• Graphs with least eigenvalue -2: ten years on
• On fat Hoffman graphs with smallest eigenvalue at least -3

This page was built for publication: Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)

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