This paper derives new stress polynomials and analyzes vertex centrality in graphs, establishing inequalities and results.
Shimbel (1953) introduced the node centrality index, which is the stress of a vertex. The number of geodesics (shortest paths) that pass through a vertex in a graph is its stress. A number that links a chemical structure to physical characteristics or chemical reactivity is called a topological index of the chemical structure (graph). This paper presents the first and second stress polynomials, which are new stress polynomials for graphs based on vertices stresses. Additionally, we compute stress polynomials for a few standard graphs, prove a few results, and establish a few inequalities.
No takes yet. Share an insight, caveat, or question.
Prajna et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: