Geodesic
Minimum dominating Randic energy of a graph
Vladikavkazskij matematičeskij žurnal, Tome 19 (2017) no. 2, pp. 28-35 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In this paper, we introduce the minimum dominating Randic energy of a graph and computed the minimum dominating Randic energy of graph. Also, obtained upper and lower bounds for the minimum dominating Randic energy of a graph. 
@article{VMJ_2017_19_2_a3,
     author = {P. S. K. Reddy and K. N. Prakasha and V. M. Siddalingaswamy},
     title = {Minimum dominating {Randic} energy of a graph},
     journal = {Vladikavkazskij matemati\v{c}eskij \v{z}urnal},
     pages = {28--35},
     year = {2017},
     volume = {19},
     number = {2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/VMJ_2017_19_2_a3/}
}
TY  - JOUR
AU  - P. S. K. Reddy
AU  - K. N. Prakasha
AU  - V. M. Siddalingaswamy
TI  - Minimum dominating Randic energy of a graph
JO  - Vladikavkazskij matematičeskij žurnal
PY  - 2017
SP  - 28
EP  - 35
VL  - 19
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/VMJ_2017_19_2_a3/
LA  - en
ID  - VMJ_2017_19_2_a3
ER  - 
%0 Journal Article
%A P. S. K. Reddy
%A K. N. Prakasha
%A V. M. Siddalingaswamy
%T Minimum dominating Randic energy of a graph
%J Vladikavkazskij matematičeskij žurnal
%D 2017
%P 28-35
%V 19
%N 2
%U http://geodesic.mathdoc.fr/item/VMJ_2017_19_2_a3/
%G en
%F VMJ_2017_19_2_a3
P. S. K. Reddy; K. N. Prakasha; V. M. Siddalingaswamy. Minimum dominating Randic energy of a graph. Vladikavkazskij matematičeskij žurnal, Tome 19 (2017) no. 2, pp. 28-35. http://geodesic.mathdoc.fr/item/VMJ_2017_19_2_a3/

[1] Bozkurt S. B., Gungor A. D., Gutman I., Cevik A. S., “Randic matrix and Randic energy”, MATCH Commum. Math. Comput. Chem., 64 (2010), 239–250 | MR | Zbl

[2] Bozkurt S. B., Gungor A. D., Gutman I., “Randic spectral radius and Randic energy”, MATCH Commum. Math. Comput. Chem., 64 (2010), 321–334 | MR | Zbl

[3] Serife Burcu Bozkurt, Durmus Bozkurt, “Sharp Upper Bounds for Energy and Randic Energy”, MATCH Commum. Math. Comput. Chem., 70 (2013), 669–680 | MR | Zbl

[4] Gutman I., Furtula B., Bozkurt S. B., “On Randic energy”, Linear Algebra Appl., 442 (2014), 50–57 | DOI | MR | Zbl

[5] Gutman I., “The energy of a graph”, Ber. Math. Stat. Sekt. Forschungsz. Graz., 103 (1978), 1–22 | MR

[6] Gutman I., “The energy of a graph: old and new results”, Combinatorics and Applications, eds. A. Betten, A. Khoner, R. Laue, A. Wassermann, Springer, Berlin, 2001, 196–211 | DOI | MR | Zbl

[7] Indulal G., Gutman I., Vijayakumar A., “On distance energy of graphs”, Match Commun. Math. Comput. Chem., 60 (2008), 461–472 | MR | Zbl

[8] Rajesh Kanna M. R., Dharmendra B. N., Sridhara G., “Minimum dominating energy of a graph”, Int. J. Pure and Appl. Math., 85:4 (2013), 707–718 | MR