Upper bound on Randić energy of some graphs

Abstract Applying the Cauchy–Schwarz inequality, we obtain a sharp upper bound on the Randic energy of a bipartite graph and of graphs whose adjacency matrix is partitioned into blocks with constant row sum.