Answers are grounded in this paper and cite their sources.
Topological indices serve as essential analytical tools in fields ranging from pharmaceutical research to network analysis. Among these, the Hosoya index is one of the most significant indices, introduced by Haruo Hosoya in 1971. It is defined as the sum of non-adjacent edge sets (matchings) for a given graph. In this article, we introduce a new matrix-based approach for calculating the Hosoya index using an effective algorithm. This technique includes a MATLAB-based implementation that systematically identifies independent edge sets. To demonstrate the application of the approach to chemical graph structures, illustrative examples involving alkane molecular graphs, RNA secondary structures, and selected chemical compounds are provided, highlighting its effectiveness and computational efficiency.
No takes yet. Share an insight, caveat, or question.
Priya et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: