Computation of distance-based polynomials and topological indices for generalized friendship graphs (G(n, k)): a Python-based approach

DOI10.47836/MJMS.19.4.15MaRDI QIDQ6870665zbMATH OpenFDO

Authors Alaa Altassan, Haseeb Ahmad

Publication date 20 January 2026

Published in Malaysian Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.47836/MJMS.19.4.15

zbMATH Keywords

distancegeneralized friendship graphHarary indexHarary polynomialHosoya polynomialhyper Wiener indexmultiplicative Wiener indexWiener index

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12)

Cites work

• A Study of Families of Bistar and Corona Product of Graph: Reverse Topological Indices
• Graphic sequences with a realization containing a generalized friendship graph
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• On edge irregular reflexive labellings for the generalized friendship graphs
• On some counting polynomials in chemistry
• Super (a,d)-edge antimagic total labelings of friendship and generalized friendship graphs
• The distance-based topological indices of the zero divisor graph for some commutative rings with the calculator app
• The Structure of Complex Networks
• Wiener index of trees: Theory and applications
• Zagreb indices and multiplicative Zagreb indices of Eulerian graphs

This page was built for publication: Computation of distance-based polynomials and topological indices for generalized friendship graphs (\(\mathscr{G}(n, k)\)): a Python-based approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6870665)