Abstract
Applying the Cauchy–Schwarz inequality, we obtain a sharp upper bound on the Randić energy of a bipartite graph and of graphs whose adjacency matrix is partitioned into blocks with constant row sum.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have