Cambridge Open Engage home
What is Cambridge Open Engage?
How to Submit
Browse
About
News [opens in a new tab]

ZAGREB CONNECTION INDICES ON POLYOMINO CHAINS AND RANDOM POLYOMINO CHAINS

23 May 2024, Version 2
Review
This content is a preprint and has not undergone peer review at the time of posting.

Abstract

In this manuscript, we delve into the exploration of the first and second Zagreb connection indices of both polyomino chains and random polyomino chains. Our methodology relies on the utilization of Markov chain theory. Within this framework, the article thoroughly examines precise formulas and investigates extreme values. Leveraging the derived formulas, we further explore and elucidate the long-term behavior exhibited by random polyomino chains.

Keywords

mathematical chemistry
topological indices
Markov chain
random graphs
polyomino chains

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.

Version History

May 23, 2024 Version 2

Version Notes

The previous pdf contained the items Theorem, Proposition ect omitted.

Metrics

206
112
0
Views
Downloads
Citations

License

CC logo
CC
BY logo
BY
The content is available under CC BY 4.0 [opens in a new tab]

DOI

10.26434/chemrxiv-2024-qmb2w-v2
D O I: 10.26434/chemrxiv-2024-qmb2w-v2 [opens in a new tab]

Funding

VIEP
No. 00389

Author’s competing interest statement

The author(s) have declared they have no conflict of interest with regard to this content

Ethics

The author(s) have declared ethics committee/IRB approval is not relevant to this content

Share