Author:
Masmali Ibtisam,Nadeem Muhammad,Yousaf Awais,Akbar Ali,Razaq Abdul,Razzaque Asima
Abstract
AbstractCounting 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.
Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. Ashrafi, A. R. et al. PI polynomial of graph. Util. Math. 71, 97–108 (2006).
2. Diudea, M. V. Omega polynomial in all R [8] lattices. Iran. J. Math. Chem. 1, 69–77 (2010).
3. Diudea, M. V. et al. Azulenic tori. MATCH Common. Math. Comput. Chem. 47, 53–70 (2003).
4. Hosoya, H. On some counting polynomials in chemistry. Discrete Appl. Math. 19, 239–257 (1988).
5. Khadikar, P. V. et al. Correlations between the benzene characters of acenes or helicences and simple molecular description. Bioorg. Med. Chem. Lett. 14, 1187–1191 (2004).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献