Computation of distance-based polynomials and topological indices for generalized friendship graphs (\(\mathscr{G}(n, k)\)): a Python-based approach (Q6870665)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8148749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation of distance-based polynomials and topological indices for generalized friendship graphs (\(\mathscr{G}(n, k)\)): a Python-based approach |
scientific article; zbMATH DE number 8148749 |
Statements
Computation of distance-based polynomials and topological indices for generalized friendship graphs (\(\mathscr{G}(n, k)\)): a Python-based approach (English)
0 references
20 January 2026
0 references
distance
0 references
generalized friendship graph
0 references
Hosoya polynomial
0 references
Harary polynomial
0 references
Wiener index
0 references
hyper Wiener index
0 references
Harary index
0 references
multiplicative Wiener index
0 references
0 references
0 references
