http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Minimum Covering Randic Energy of a Graph
Prakasha, Kunkunadu Nanjundappa,Polaepalli, Siva Kota Reddy,Cangul, Ismail Naci Department of Mathematics 2017 Kyungpook mathematical journal Vol.57 No.4
In this paper, we introduce the minimum covering Randic energy of a graph. We compute minimum covering Randic energy of some standard graphs and establish upper and lower bounds for this energy. Also we disprove a conjecture on Randic energy which is proposed by S. Alikhani and N. Ghanbari, [2].