Minimum Covering Randic Energy of a Graph

Prakasha K. N., Polaepalli S. K. R., CANGÜL İ. N.

KYUNGPOOK MATHEMATICAL JOURNAL, cilt.57, sa.4, ss.701-709, 2017 (ESCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 57 Sayı: 4
  • Basım Tarihi: 2017
  • Doi Numarası: 10.5666/kmj.2017.57.4.701
  • Dergi Adı: KYUNGPOOK MATHEMATICAL JOURNAL
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus
  • Sayfa Sayıları: ss.701-709
  • Anahtar Kelimeler: minimum covering set, minimum covering Randic eigenvalues, minimum covering Randic energy
  • Bursa Uludağ Üniversitesi Adresli: Evet

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