← All problems

Freitas–Nikiforov–Patuzzi Q-index extremal problem for odd-wheel-free graphs

For each fixed integer k≥3k\ge 3, determine, for all sufficiently large integers nn, the maximum signless-Laplacian spectral radius q(G)=λmax⁡(D(G)+A(G))q(G)=\lambda_{\max}(D(G)+A(G)) among all nn-vertex graphs GG containing no subgraph isomorphic to the odd wheel W2k+1=K1∨C2kW_{2k+1}=K_1\vee C_{2k}, and characterize the extremal graphs. The claimed answer is that there exists n0(k)n_0(k) such that, for every n≥n0(k)n\ge n_0(k),

q(G)≤q ⁣(Kk∨(K2∪K‾n−k−2)),q(G)\le q\!\left(K_k\vee\left(K_2\cup\overline{K}_{n-k-2}\right)\right),

with equality if and only if G≅Kk∨(K2∪K‾n−k−2)G\cong K_k\vee\left(K_2\cup\overline{K}_{n-k-2}\right), where K‾n−k−2=(n−k−2)K1\overline{K}_{n-k-2}=(n-k-2)K_1.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

An October 2026 preprint claims to solve this extremal graph problem for every fixed parameter at least three and sufficiently large graph size, but the claim has not been independently assessed.

The problem asks for the graph maximizing the signless-Laplacian index among graphs avoiding a specified odd wheel. Hongyu Wang and Yue Ma claim that, for fixed k≥3k \ge 3 and sufficiently large nn, the unique maximizer is Kk∨(K2∪K‾n−k−2)K_k \vee (K_2 \cup \overline{K}_{n-k-2}).

Related result

A 2025 preprint gives a different large-nn extremal theorem for odd wheels under the α\alpha-spectral radius; at α=12\alpha=\frac12 it yields a signless-Laplacian result with extremal graph Tn,3T_{n,3}, but it does not establish the claimed Freitas–Nikiforov–Patuzzi formulation.

October 2026 claimed solution

An October 2026 preprint by Wang and Ma, Maxima of the Q-index: Forbidden an odd wheel, claims the stated unique-maximizer theorem and therefore a broad resolution of the problem. The result is unrefereed, and no independent mathematical assessment was found.

Current status (as of November 2026): The claimed theorem covers the stated large-nn cases, but it remains an unverified preprint claim rather than an independently established solution.

Sources

Solutions 0

No solutions have been posted yet.