The Least Eigenvalue of Graphs with Given Clique Number

In this paper, we determine the unique graph whose least eigenvalue attains the minimum among all the connected simple graphs with given clique number.

Authors

Institutions

Publication Details

Journal
Algebra Colloquium
Published
2026-02-27
DOI
https://doi.org/10.1142/s1005386726000064
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Least Eigenvalue of Graphs with Given Clique Number

Keng Li, Guoping Wang, Huan Qiu
Algebra Colloquium
Graph theory and applications
article

The Least Eigenvalue of Graphs with Given Clique Number

Keng Li, Guoping Wang, Huan Qiu
article en

Abstract

In this paper, we determine the unique graph whose least eigenvalue attains the minimum among all the connected simple graphs with given clique number.

Algebra ColloquiumVol. 33(01)
Xinjiang Normal University (CN), Hubei University of Automotive Technology (CN), China XD Group (China) (CN)
Reduced inequalities
Openalex Percentile: Top 37%
Graph theory and applications
DOISourceOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Least Eigenvalue of Graphs with Given Clique Number — Keng Li, Guoping Wang, et al. · Algebra Colloquium (2026) | TGRS Research Map | TGRS