Energy conditions for Hamiltonicity of graphs (Q2320735)

Summary: Let \(G\) be an undirected simple graph of order \(n\). Let \(A(G)\) be the adjacency matrix of \(G\), and let \(\mu_1(G) \leq \mu_2(G) \leq \cdots \leq \mu_n(G)\) be its eigenvalues. The energy of \(G\) is defined as \(\mathcal{E}(G) = \sum_{i = 1}^n | \mu_i(G) |\). Denote by \(G_{\text{BPT}}\) a bipartite graph. In this paper, we establish the sufficient conditions for \(G\) having a Hamiltonian path or cycle or to be Hamilton-connected in terms of the energy of the complement of \(G\), and give the sufficient condition for \(G_{\text{BPT}}\) having a Hamiltonian cycle in terms of the energy of the quasi-complement of \(G_{\text{BPT}}\).