Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 73 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 13 tok/s Pro
GPT-5 High 14 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 156 tok/s Pro
GPT OSS 120B 388 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

On signed graphs whose spectral radius does not exceed $\sqrt{2+\sqrt{5}}$ (2203.01530v2)

Published 3 Mar 2022 in math.CO

Abstract: The Hoffman program with respect to any real or complex square matrix $M$ associated to a graph $G$ stems from Hoffman's pioneering work on the limit points for the spectral radius of adjacency matrices of graphs does not exceed $\sqrt{2+\sqrt{5}}$. A signed graph $\dot{G}=(G,\sigma)$ is a pair $(G,\sigma),$ where $G=(V,E)$ is a simple graph and $\sigma: E(G)\rightarrow {+1,-1}$ is the sign function. In this paper, we study the Hoffman program of signed graphs. Here, all signed graphs whose spectral radius does not exceed $\sqrt{2+\sqrt{5}}$ will be identified.

Citations (5)

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube