October 8, 2025Open Access

On non-bipartite graphs with integral signless Laplacian eigenvalues at most 6

View Full Paper

Ask AI

Bookmark

The classification reveals structural properties of non-bipartite graphs with strict eigenvalue limits.
Integral signless Laplacian eigenvalues define a crucial threshold for graph connectivity.
Connected non-bipartite graphs exhibit unique characteristics when eigenvalues are bounded at most by 6.
Understanding these eigenvalues can lead to better insights into graph theoretical properties and applications.

Implication

This paper classifies non-bipartite graphs based on signless Laplacian eigenvalues, revealing their structure.

In this paper, we completely classify the connected non-bipartite graphs with integral signless Laplacian eigenvalues at most 6.

No takes yet. Share an insight, caveat, or question.

Oh et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark

This paper classifies non-bipartite graphs based on signless Laplacian eigenvalues, revealing their structure.

In this paper, we completely classify the connected non-bipartite graphs with integral signless Laplacian eigenvalues at most 6.