Yayın:
Minimum covering randic energy of a graph

Placeholder

Akademik Birimler

Kurum Yazarları

Cangül, İsmail Naci

Yazarlar

Prakasha, Kunkunadu Nanjundappa
Polaepalli, Siva Kota Reddy

Danışman

Dil

Türü

Yayıncı:

Kyungpook Natl Univ, Dept Mathematics

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Özet

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].

Açıklama

Kaynak:

Anahtar Kelimeler:

Konusu

Minimum covering set, Minimum covering randic eigenvalues, Minimum covering randic energy, Science & technology, Physical sciences, Mathematics

Alıntı

Endorsement

Review

Supplemented By

Referenced By

1

Views

0

Downloads

View PlumX Details