IJSMT Journal

International Journal of Science, Strategic Management and Technology

An International, Peer-Reviewed, Open Access Scholarly Journal Indexed in recognized academic databases · DOI via Crossref The journal adheres to established scholarly publishing, peer-review, and research ethics guidelines set by the UGC

ISSN: 3108-1762 (Online)
webp (1)

Plagiarism Passed
Peer reviewed
Open Access

UPPER BOUNDS FOR THE PRODUCT HARARY–FURTULA INDEX OF SPLICE AND THORN GRAPHS

AUTHORS:
P. Kandan
S. Niranjan
Mentor
Affiliation
Department of Mathematics Government Arts College ,Mutlur 608 002 India
CC BY 4.0 License:
This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract







This paper studies upper bounds for the product Harary–Furtula index RD (G) of splice and thorn graphs. For the splice graph obtained by joining selected vertices of two connected graphs with a new edge, the changes in vertex degrees and distances are analyzed to derive an upper bound in terms of the structural parameters of the constituent graphs. The study is further extended to thorn graphs formed by attaching pendant vertices to the vertices of a given graph. Suitable parameters involving the number of pendant vertices, degree bounds, and distance contributions are introduced to establish an upper bound for the product Harary–Furtula index. A special case in which the same number of pendant vertices is attached to every vertex is also considered. The results provide useful inequalities for the product Harary–Furtula index under these graph constructions.

 
Keywords
Product Harary–Furtula Index Splice Graph Thorn Graph Graph Operations Upper Bounds.
Article Metrics
Article Views
3
PDF Downloads
0
HOW TO CITE
APA

MLA

Chicago

Copy

Kandan, P. & Niranjan, S. (2026). Upper Bounds for the Product Harary–Furtula Index of Splice and Thorn Graphs. International Journal of Science, Strategic Management and Technology, 02(8), 1-9. https://doi.org/10.55041/ijsmt.v2i8.058

Kandan, P., and S. Niranjan. "Upper Bounds for the Product Harary–Furtula Index of Splice and Thorn Graphs." International Journal of Science, Strategic Management and Technology, vol. 02, no. 8, 2026, pp. 1-9. doi:https://doi.org/10.55041/ijsmt.v2i8.058.

Kandan, P., and S. Niranjan. "Upper Bounds for the Product Harary–Furtula Index of Splice and Thorn Graphs." International Journal of Science, Strategic Management and Technology 02, no. 8 (2026): 1-9. https://doi.org/https://doi.org/10.55041/ijsmt.v2i8.058.

References

  • Wiener , (1947), Structural determination of paraffin boiling points, J. Am. Chem. Soc., 69, 17–20.

  • Dobrynin A., Entringer R., Gutman I., (2001), Wiener index of trees: Theory and applications, Acta Appl. Math., 66, 211–249.

  • Plavsˇic´ , Nikolic´ S., Trinajstic´ N., Mihalic´ Z., (1993), On the Harary index for the characterization of chemical graphs, J. Math. Chem., 12, 235–250.



  • Xu K., Das K. C., (2011), On Harary index of graphs, Discrete Appl. Math., 159, 1631–

  • Zhou , Cai X., Trinajstic´ N., (2008), On the Harary index, J. Math. Chem., 44, 611–618.

  • Gutman , Trinajstic´ N., (1972), Graph theory and molecular orbitals. Total π -electron energy of alternant hydrocarbons, Chem. Phys. Lett., 17, 535–538.

  • Furtula , Gutman I., (2015), A forgotten topological index, J. Math. Chem., 53, 1184–1190.

  • Trinajstic´ N., Nikolic´ S., Basak S. C., Lukovits I., (2001), Distance indices and their hyper-counterparts: Intercorrelation and use in structure–property modeling, SAR QSAR Environ. Res., 12, 31–54.



  • Gutman , Furtula B., Redzˇepovic´ I., (2024), On topological indices and their reciprocals, MATCH Commun. Math. Comput. Chem., 91, 287–297.

  • Xu , Trinajstic´ N., (2011), Hyper-Wiener and Harary indices of graphs with cut edges, Util. Math., 84, 153–163.

Ethics and Compliance
✓ All ethical standards met
This article has undergone plagiarism screening and double-blind peer review. Editorial policies have been followed. Authors retain copyright under CC BY-NC 4.0 license. The research complies with ethical standards and institutional guidelines.
Indexed In
Similar Articles
Scroll to Top