Steiner 3-Wiener Index of Zigzag Polyhex Nanotubes.

Background: Let G be a connected graph and S be a k element subset of the vertex set V(G) of G. Steiner distance is a natural generalization of the usual graph distance. The Steiner-k distance dG(S) between the vertices of S is the minimum size among all connected subgraphs whose vertex set contains S.

M, NM-polynomials Based on Reverse, Reduced Reverse Degree and Neighborhood Degree Based Topological Indices with Applications to Bond Energy of Y-Junction Nanotubes.

Background: In graph theory, M polynomials like the matching polynomial are very crucial in examining the matching structures within graphs, while NM polynomials extends this to analyze non-matching edges. These polynomials are important in many fields, including chemistry and network architecture. They support the derivation of topological indices for protein structure analysis, network communication optimization, and drug design in QSAR/QSPR investigations.