The non-cycle bound for the non-backtracking Laplacian parameter

Let GG be a graph with minimum degree

andletand let

denote the parameter introduced above. Assume that GG is not the cycle graph. Non-cycle bound.

ε1δ1.\varepsilon\leq \frac{1}{\delta-1}.

This conjecture refines the preceding general bound for graphs of minimum degree at least two; its status is not determined by the supplied context.

Sources & referencesView supporting material

Primary source

Raffaella Mulas, Dong Zhang and Giulio Zucal, “There is no going back: Properties of the non-backtracking Laplacian”, arXiv:2303.00373 (2023).

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.