Yayın:
Minimum equitable dominating harary energy of a graph

Basit Görünüm
dc.contributor.authorPrakasha K.N.
dc.contributor.authorMahalank, Pushpalatha
dc.contributor.authorCangül, İsmail Naci
dc.contributor.buuauthorCANGÜL, İSMAİL NACİ
dc.contributor.departmentFen ve Edebiyat Fakültesi
dc.contributor.departmentMatematik Bölümü
dc.contributor.orcid0000-0002-0700-5774
dc.contributor.scopusid57189022403
dc.date.accessioned2025-05-12T22:37:58Z
dc.date.issued2024-01-01
dc.description.abstractThe purpose of this paper is to introduce the concept of minimum equitable dominating Harary energy HEed(G) of a graph. We also compute the minimum equitable dominating Harary energy HEed(G) of some families of graphs. We establish bounds for minimum equitable dominating Harary energy. Open problems are also given for further research.
dc.identifier.doi10.17777/pjms2024.27.1.65
dc.identifier.endpage72
dc.identifier.issn1598-7264
dc.identifier.issue1
dc.identifier.scopus2-s2.0-85184885200
dc.identifier.startpage65
dc.identifier.urihttps://hdl.handle.net/11452/51409
dc.identifier.volume27
dc.indexed.scopusScopus
dc.language.isoen
dc.publisherJangjeon Research Institute for Mathematical Sciences and Physics
dc.relation.journalProceedings of the Jangjeon Mathematical Society
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectMinimum equitable dominating set
dc.subjectMinimum equitable dominating Harary energy of a graph
dc.subjectMinimum equitable dominating Harary eigenvalues
dc.subject.scopusGraph Energy and Eigenvalue Relationships in Networks
dc.titleMinimum equitable dominating harary energy of a graph
dc.typeArticle
dspace.entity.typePublication
local.contributor.departmentFen ve Edebiyat Fakültesi/Matematik Bölümü
local.indexed.atScopus
relation.isAuthorOfPublication601ef81f-9bdf-4a4a-9ac1-82a82260384d
relation.isAuthorOfPublication.latestForDiscovery601ef81f-9bdf-4a4a-9ac1-82a82260384d

Dosyalar

Koleksiyonlar

İndeksli Yayınlar / Indexed Publications