Answers are grounded in this paper and cite their sources.
For a given graph, let w k denote the number of its walks with k vertices and let 1 denote the spectral radius of its adjacency matrix. Nikiforov asked in [Linear Algebra Appl 418 (2006), 257-268] whether it is true in a connected bipartite graph that r 1 w s+r w s for every even s 2 and even r 2? We construct here several infinite sequences of connected bipartite graphs with two main eigenvalues for which the ratio w s+r r 1 w s is larger than 1 for every even s, r 2, and thus provide a negative answer to the above problem.
No takes yet. Share an insight, caveat, or question.
Feng et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: