Abstract:
The Hankel matrix corresponding to the sequence (a_1,a_2,...,a_{2n-1}) is a matrix of order n. This matrix is graphical only when a_1=a_3=a_5=...=a_{2n-1}=0 and a_2, a_4, a_6, ...a_{2n-2} 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.