NEIGHBORS STRESS SUM ENERGY OF GRAPHS
Proceedings of the Jangjeon Mathematical Society, cilt.28, sa.3, ss.251-264, 2025 (Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 28 Sayı: 3
- Basım Tarihi: 2025
- Doi Numarası: 10.17777/pjms2025.28.3.251
- Dergi Adı: Proceedings of the Jangjeon Mathematical Society
- Derginin Tarandığı İndeksler: Scopus, zbMATH
- Sayfa Sayıları: ss.251-264
- Anahtar Kelimeler: Energy, Graph, Neighbors stress sum matrix and the Neighbors stress sum energy, Neighbors stress sum of a vertex, Stress of a vertex
- Bursa Uludağ Üniversitesi Adresli: Evet
Özet
In 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 ENSS(G), for a graph G. Further, we established bounds, and characterized the largest eigenvalue of NSS(G).