The generalized distance spectral radius conjecture for digraphs

Let n,kn,k be positive integers, let 0<α<10<\alpha<1, and let GGn,kG\in\mathcal{G}_{n,k}. Here, μα(G)\mu_\alpha(G) denotes the generalized distance spectral radius of GG, and K(n,k,1)K(n,k,1) is the specified extremal digraph in the paper. Generalized distance spectral radius conjecture. One has

μα(G)μα(K(n,k,1)),\mu_\alpha(G)\geq\mu_\alpha(K(n,k,1)),

with equality if and only if GK(n,k,1)G\cong K(n,k,1). This conjecture proposes the extremal characterization for the general case, extending the cases established earlier in the paper; its resolution is not supplied in the source.

Sources & referencesView supporting material

Primary source

Weige Xi, Wasin So and Ligong Wang, “The generalized distance matrix of digraphs”, arXiv:1811.08322 (2018).

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.