NEIGHBORS STRESS SUM ENERGY OF GRAPHS
Proceedings of the Jangjeon Mathematical Society, vol.28, no.3, pp.251-264, 2025 (Scopus)
- Publication Type: Article / Article
- Volume: 28 Issue: 3
- Publication Date: 2025
- Doi Number: 10.17777/pjms2025.28.3.251
- Journal Name: Proceedings of the Jangjeon Mathematical Society
- Journal Indexes: Scopus, zbMATH
- Page Numbers: pp.251-264
- Keywords: Energy, Graph, Neighbors stress sum matrix and the Neighbors stress sum energy, Neighbors stress sum of a vertex, Stress of a vertex
- Bursa Uludag University Affiliated: Yes
Abstract
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).