Yayın:
Minimum covering randic energy of a graph

dc.contributor.authorPrakasha, Kunkunadu Nanjundappa
dc.contributor.authorPolaepalli, Siva Kota Reddy
dc.contributor.buuauthorCangül, İsmail Naci
dc.contributor.buuauthorCANGÜL, İSMAİL NACİ
dc.contributor.departmentFen Edebiyat Fakültesi
dc.contributor.departmentMatematik Ana Bilim Dalı
dc.contributor.researcheridJ-3505-2017
dc.date.accessioned2024-11-08T05:47:47Z
dc.date.available2024-11-08T05:47:47Z
dc.date.issued2017-12-01
dc.description.abstractIn 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].
dc.identifier.doi10.5666/KMJ.2017.57.4.701
dc.identifier.endpage709
dc.identifier.issn1225-6951
dc.identifier.issue4
dc.identifier.scopus2-s2.0-85038227204
dc.identifier.startpage701
dc.identifier.urihttps://doi.org/10.5666/KMJ.2017.57.4.701
dc.identifier.urihttps://hdl.handle.net/11452/47599
dc.identifier.volume57
dc.identifier.wos000430884400013
dc.indexed.wosWOS.ESCI
dc.language.isoen
dc.publisherKyungpook Natl Univ, Dept Mathematics
dc.relation.bapF-2015/17
dc.relation.bap2015/23
dc.relation.bap2016/9
dc.relation.journalKyungpook Mathematical Journal
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectMinimum covering set
dc.subjectMinimum covering randic eigenvalues
dc.subjectMinimum covering randic energy
dc.subjectScience & technology
dc.subjectPhysical sciences
dc.subjectMathematics
dc.titleMinimum covering randic energy of a graph
dc.typeArticle
dspace.entity.typePublication
local.contributor.departmentFen Edebiyat Fakültesi/Matematik Ana Bilim Dalı
local.indexed.atWOS
local.indexed.atScopus
relation.isAuthorOfPublication601ef81f-9bdf-4a4a-9ac1-82a82260384d
relation.isAuthorOfPublication.latestForDiscovery601ef81f-9bdf-4a4a-9ac1-82a82260384d

Dosyalar