Abstract
Abstract A family of chemical compounds known as metal–organic networks (MONs) is composed mainly of clusters of metal ions with organic ligands. It can increase volatility or make substances soluble in organic solvents. By using these salient features, organic compounds generate applications in material sciences for sol–gel processing. A graph’s entropy is utilized as a complexity indicator and is interpreted as the structural information content of the graph. Investigating the entropies of relationship systems is a common occurrence in discrete mathematics, computer science, information theory, statistics, chemistry, and biology. In this article, we investigated the degree-based entropies: geometric arithmetic entropy, atom bond connectivity entropy, general Randic′ entropy, and general sum connectivity entropy for MONs. Furthermore, we created tables for all expressions by using 1–10 values for the s s parameter of these entropies.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
