Ning–Lu–Wang spectral-radius conjecture for edge connectivity
Let be the set of graphs of order with minimum degree and edge connectivity . Let be the graph obtained from by adding edges joining one vertex in to vertices in . Ning–Lu–Wang conjecture. For , is the graph with the maximum spectral radius in . 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.
References
Primary source
Dandan Fan, Xiaofeng Gu and Huiqiu Lin, “Spectral radius and edge-disjoint spanning trees”, arXiv:2207.04701 (2022).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.