Minimum Dominating Randic Energy of a Graph

For citation: Reddy P. S. K., Prakasha K. N., Siddalingaswamy V. M. Minimum Dominating Randic Energy of a Graph.Vladikavkazskij matematicheskij zhurnal [Vladikavkaz Math. J.], vol. 19, no. 1, pp. 28-35. DOI 10.23671/VNC.2017.2.6506

1. Bozkurt S. B.,  Gungor A. D.,  Gutman I.,  Cevik A. S. Randic
matrix and Randic energy. MATCH Commum. Math. Comput. Chem. 2010,
vol. 64, pp. 239-250.

2. Bozkurt S. B.,  Gungor A. D.,  Gutman I. Randic spectral radius
and Randic energy.  MATCH Commum. Math. Comput. Chem. 2010, vol.
64, pp. 321-334.

3. Serife Burcu Bozkurt, Durmus Bozkurt. Sharp Upper Bounds for
Energy and Randic Energy. MATCH Commum. Math. Comput. Chem. 2013,
vol. 70. pp. 669-680.

4. Gutman I., Furtula B., Bozkurt S. B. On Randic energy. Linear
Algebra Appl. 2014, vol. 442. pp. 50-57.

5. Gutman I. The energy of a graph. Ber. Math. Stat. Sekt.
Forschungsz. Graz. 1978. 103. pp. 1-22.

6. Gutman I. The energy of a graph: old and new results.
Combinatorics and Applications / A. Betten, A. Khoner, R. Laue and
A. Wassermann, eds. Berlin: Springer, 2001. pp. 196-211.

7. Indulal G., Gutman I., Vijayakumar  A. On distance energy of
graphs. Match Commun. Math. Comput. Chem. 2008, vol. 60, pp.
461-472.

8. Rajesh Kanna M. R., Dharmendra B. N.,  Sridhara G. Minimum
dominating energy of a graph. Int. J. Pure and Appl. Math. 2013,
vol. 85, no. 4. pp. 707-718.