Computing Hosoya index using an efficient matrix-based approach in MATLAB for general graphs

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.

Authors

Institutions

Publication Details

Journal
Frontiers in Chemistry
Published
2026-11-18
DOI
https://doi.org/10.3389/fchem.2026.1919539
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Computing Hosoya index using an efficient matrix-based approach in MATLAB for general graphs

J Vithiya Priya, K Karthika
1 links
Frontiers in Chemistry
Graph theory and applications
article

Computing Hosoya index using an efficient matrix-based approach in MATLAB for general graphs

J Vithiya Priya, K Karthika
article en

Abstract

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.

Frontiers in ChemistryVol. 14
Vellore Institute of Technology University (IN)
VIT University
Graph theory and applications
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.

Laika access coming soon