Yayın:
Neighbors stress sum energy of graphs

Basit Görünüm
dc.contributor.authorKirankumar, M.
dc.contributor.authorSalestina, M.R.
dc.contributor.authorReddy, P.S.K.
dc.contributor.buuauthorCANGÜL, İSMAİL NACİ
dc.contributor.departmentFen Edebiyat Fakültesi
dc.contributor.departmentMatematik Ana Bilim Dalı
dc.contributor.scopusid59158462000
dc.date.accessioned2025-11-28T12:11:35Z
dc.date.issued2025-01-01
dc.description.abstractIn this article, we introduced the concept of the Neighbors Stress Sum of a vertex and a new matrix for a connected graph G. In this matrix, the sum of the i-th row and the i-th column are both equal to the Neighbors Stress Sum of the i-th vertex. Additionally, we define a new graph energy variant called the Neighbors Stress Sum Energy, denoted as E<inf>NSS</inf>(G), for a graph G. Further, we established bounds, and characterized the largest eigenvalue of NSS(G).
dc.identifier.doi10.17777/pjms2025.28.3.251
dc.identifier.endpage 264
dc.identifier.issn1598-7264
dc.identifier.issue3
dc.identifier.scopus2-s2.0-105014289867
dc.identifier.startpage251
dc.identifier.urihttps://hdl.handle.net/11452/57106
dc.identifier.volume28
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.subjectStress of a vertex
dc.subjectNeighbors stress sum of a vertex
dc.subjectNeighbors stress sum matrix and the Neighbors stress sum energy
dc.subjectGraph
dc.subjectEnergy
dc.titleNeighbors stress sum energy of graphs
dc.typeArticle
dspace.entity.typePublication
local.contributor.departmentFen Edebiyat Fakültesi/Matematik Ana Bilim Dalı
local.indexed.atScopus
relation.isAuthorOfPublication601ef81f-9bdf-4a4a-9ac1-82a82260384d
relation.isAuthorOfPublication.latestForDiscovery601ef81f-9bdf-4a4a-9ac1-82a82260384d

Dosyalar

Koleksiyonlar

İndeksli Yayınlar / Indexed Publications