Fat Hoffman graphs with smallest eigenvalue greater than -3

DOI10.1016/J.DAM.2014.01.008zbMATH Open1298.05205arXiv1211.3929OpenAlexW2107351180MaRDI QIDQ403567FDOQ403567

Authors: Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi 

Publication date: 29 August 2014

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• Distance-hereditary graphs
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• On fat Hoffman graphs with smallest eigenvalue at least -3
• A Characterization of Block-Graphs
• On spectral characterization and embeddings of graphs
• Line graphs, root systems, and elliptic geometry
• Fat Hoffman graphs with smallest eigenvalue at least −1 − τ
• On graphs with the smallest eigenvalue at least −1 − √2, part I
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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 (5)

• Edge-signed graphs with smallest eigenvalue greater than \(-2\)
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• Strongly 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)