Diaz, J.B. and Matcalf, F.T. (1963) Stronger Forms of a Class Inequalities of G. Polja-G. Szego and L. V. Kantorovich. Bulletin of the American Mathematical Society, 69, 415-418.
https://doi.org/10.1090/S0002-9904-1963-10953-2

has been cited by the following article:

• TITLE: Minimum Covering Randić Energy of a Graph

  AUTHORS: M. R. Rajesh Kanna, R. Jagadeesh

  KEYWORDS: Minimum Covering Set, Minimum Covering Randić Matrix, Minimum Covering Randić Eigenvalues, Minimum Covering Randić Energy

  JOURNAL NAME: Advances in Linear Algebra & Matrix Theory, Vol.6 No.4, December 5, 2016

  ABSTRACT: Randić energy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randić energy REC (G) of a graph G in this paper. This paper contains computation of minimum covering Randić energies for some standard graphs like star graph, complete graph, thorn graph of complete graph, crown graph, complete bipartite graph, cocktail graph and friendship graphs. At the end of this paper, upper and lower bounds for minimum covering Randić energy are also presented.