An effective technique for developing the graphical polynomials of certain molecular graphs.
Journal
Scientific reports
ISSN: 2045-2322
Titre abrégé: Sci Rep
Pays: England
ID NLM: 101563288
Informations de publication
Date de publication:
23 Mar 2023
23 Mar 2023
Historique:
received:
27
01
2023
accepted:
14
03
2023
entrez:
24
3
2023
pubmed:
25
3
2023
medline:
25
3
2023
Statut:
epublish
Résumé
Counting Polynomial is the mathematical function that was initially introduced for application in chemistry in 1936 by G. Polya. Partitioning of graphs can be seen in the coefficients of these mathematical functions, which also reveal the frequency with which these partitions happen. We developed a novel and efficient method for constructing the necessary counting polynomials for a zigzag-edge coronoid formed by the fusion of a Starphene graph and a Kekulenes graph. The study's methods expand our knowledge, and its findings potentially provide insight on the topology of these chemical structures.
Identifiants
pubmed: 36959314
doi: 10.1038/s41598-023-31623-7
pii: 10.1038/s41598-023-31623-7
pmc: PMC10036473
doi:
Types de publication
Journal Article
Langues
eng
Sous-ensembles de citation
IM
Pagination
4764Informations de copyright
© 2023. The Author(s).
Références
Bioorg Med Chem Lett. 2004 Mar 8;14(5):1187-91
pubmed: 14980662
Sci Rep. 2019 Jun 24;9(1):9129
pubmed: 31235871