Kepler stress exponential for graphs
In 1953, Alfonso Shimbel introduced the concept of vertex stress in a graph. The stress of a vertex in a graph is the number of shortest paths passing through it. This paper describes the Kepler stress exponential $KS(G,x)$ of graphs and presents findings, including a characterization of graphs with non-zero constant vertex stress polynomials. Similarly, we established the importance of the Kepler stress exponential in predicting the physicochemical properties of butane derivatives.
Authors
- Puttaswamy Puttaswamy
- K. Karthik
- M. Pavithra
- M. Kirankumar
Institutions
- University of Mysore (IN)
- Karnataka State Open University (IN)
- Visvesvaraya Technological University (IN)
Publication Details
- Journal
- Boletim da Sociedade Paranaense de Matemática
- Published
- 2025-07-12
- DOI
- https://doi.org/10.5269/bspm.76746
- Primary Topic
- Computational Drug Discovery Methods
- Type
- article
- Field-Weighted Citation Impact
- 0.00