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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Kepler stress exponential for graphs

Puttaswamy Puttaswamy, K. Karthik, M. Pavithra, M. Kirankumar
Boletim da Sociedade Paranaense de Matemática
Computational Drug Discovery Methods
article

Kepler stress exponential for graphs

Puttaswamy Puttaswamy, K. Karthik, M. Pavithra, M. Kirankumar
article en

Abstract

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.

Boletim da Sociedade Paranaense de MatemáticaVol. 43
University of Mysore (IN), Karnataka State Open University (IN), Visvesvaraya Technological University (IN)
Openalex Percentile: Top 75%
Computational Drug Discovery Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.