Ning–Lu–Wang spectral-radius conjecture for edge connectivity

From papers

Let Anκ,δ\mathcal{A}_{n}^{\kappa',\delta} be the set of graphs of order nn with minimum degree δ\delta and edge connectivity κ\kappa'. Let Bn,δ+1κB_{n,\delta+1}^{\kappa'} be the graph obtained from Kδ+1Knδ1K_{\delta+1}\cup K_{n-\delta-1} by adding κ\kappa' edges joining one vertex in Kδ+1K_{\delta+1} to κ\kappa' vertices in Knδ1K_{n-\delta-1}. Ning–Lu–Wang conjecture. For 4κ<δ4\leq\kappa'<\delta, Bn,δ+1κB_{n,\delta+1}^{\kappa'} is the graph with the maximum spectral radius in Anκ,δ\mathcal{A}_{n}^{\kappa',\delta}. The source says that this conjecture is settled by the paper's results, but the supplied excerpt does not state the exact resolving theorem or its hypotheses.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Dandan Fan, Xiaofeng Gu and Huiqiu Lin, “Spectral radius and edge-disjoint spanning trees”, arXiv:2207.04701 (2022).

Solutions 0

No solutions have been posted yet.