Geodesic
Minimum dominating Randic energy of a graph
Vladikavkazskij matematičeskij žurnal, Tome 19 (2017) no. 2, pp. 28-35

Voir la notice de l'article provenant de la source Math-Net.Ru

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},
     publisher = {mathdoc},
     volume = {19},
     number = {2},
     year = {2017},
     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
PB  - mathdoc
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
%I mathdoc
%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/