This research determines the unique graph with the minimum least eigenvalue given a specific clique number, suggesting new insights in graph theory.
In this paper, we determine the unique graph whose least eigenvalue attains the minimum among all the connected simple graphs with given clique number.
No takes yet. Share an insight, caveat, or question.
Li et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: