Analysis reveals energy bounds for bipartite graphs from Hankel sequences, indicating structural properties of Hankel matrices.
The Hankel matrix corresponding to the sequence (a_1,a_2,...,a₂ₙ₋₁) is a matrix of order n. This matrix is graphical only when a_1=a_3=a_5=...=a₂ₙ₋₁=0 and a_2, a_4, a_6, ...a₂ₙ₋₂ is either 0 or 1. The phrase "Hankel graph" refers to such a graph. The Hankel graphs so generated are the bipartite graphs. In this paper, the energy bound for bipartite graphs generated by some Hankel sequences has been determined.
No takes yet. Share an insight, caveat, or question.
H. S. Sujatha (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: