Perron eigenvalue conjecture for the component
Perron eigenvalue conjecture for the component
Let , let be the relevant digraph, and let be its distinguished component. The maximum eigenvalue of a digraph means the largest eigenvalue of its adjacency matrix, and a maximum-modulus eigenvalue is an eigenvalue whose absolute value is maximal. Perron eigenvalue conjecture. The maximum eigenvalue of is the unique maximum-modulus eigenvalue of .
This claim is motivated by computations for , which indicate that the maximum eigenvalue is simple, unique in modulus, and attached to . The source presents the assertion as an unresolved computationally observed property.
Sources & referencesView supporting material
Primary source
Jelena Djokić, Olga Bodroža-Pantić and Ksenija Doroslovački, “A spanning union of cycles in rectangular grid graphs, thick grid cylinders and Moebius strips”, arXiv:2109.12432 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.