Topological Properties of Sierpinski Network and its Application
Copyright© Bentham Science Publishers; For any queries, please email at epubbenthamscience.net..
BACKGROUND: Sierpinski graphs S(n, k) are largely studied because of their fractal nature with applications in topology, chemistry, mathematics of Tower of Hanoi and computer sciences. Applications of molecular structure descriptors are a standard procedure which are used to correlate the biological activity of molecules with their chemical structures, and thus can be helpful in the field of pharmacology.
OBJECTIVE: The aim of this article is to establish analytically closed computing formulae for eccentricity-based descriptors of Sierpinski networks and their regularizations. These computing formulae are useful to determine a large number of properties like thermodynamic properties, physicochemical properties, chemical and biological activity of chemical graphs Methods: At first, vertex sets have been partitioned on the basis of their degrees, eccentricities and frequencies of occurrence. Then these partitions are used to compute the eccentricity-based indices with the aid of some combinatorics.
RESULTS: The total eccentric index and eccentric-connectivity index have been computed. We also compute some eccentricity-based Zagreb indices of the Sierpinski networks. Moreover, a comparison has also been presented in the form of graphs.
CONCLUSION: These computations will help the readers to estimate the thermodynamic properties and physicochemical properties of chemical structure which are of fractal nature and can not be dealt with easily. A 3D graphical representation is also presented to understand the dynamics of the aforementioned topological descriptors.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2022 |
|---|---|
| Erschienen: |
2022 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:25 |
|---|---|
| Enthalten in: |
Combinatorial chemistry & high throughput screening - 25(2022), 3 vom: 04., Seite 568-578 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Fang, Juanyan [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
Chemical graphs. |
|---|
| Anmerkungen: |
Date Completed 22.03.2022 Date Revised 22.03.2022 published: Print Citation Status MEDLINE |
|---|
| doi: |
10.2174/1386207324666210713114755 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM328047589 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM328047589 | ||
| 003 | DE-627 | ||
| 005 | 20231225202124.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231225s2022 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.2174/1386207324666210713114755 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n1093.xml |
| 035 | |a (DE-627)NLM328047589 | ||
| 035 | |a (NLM)34259141 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Fang, Juanyan |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Topological Properties of Sierpinski Network and its Application |
| 264 | 1 | |c 2022 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Completed 22.03.2022 | ||
| 500 | |a Date Revised 22.03.2022 | ||
| 500 | |a published: Print | ||
| 500 | |a Citation Status MEDLINE | ||
| 520 | |a Copyright© Bentham Science Publishers; For any queries, please email at epubbenthamscience.net. | ||
| 520 | |a BACKGROUND: Sierpinski graphs S(n, k) are largely studied because of their fractal nature with applications in topology, chemistry, mathematics of Tower of Hanoi and computer sciences. Applications of molecular structure descriptors are a standard procedure which are used to correlate the biological activity of molecules with their chemical structures, and thus can be helpful in the field of pharmacology | ||
| 520 | |a OBJECTIVE: The aim of this article is to establish analytically closed computing formulae for eccentricity-based descriptors of Sierpinski networks and their regularizations. These computing formulae are useful to determine a large number of properties like thermodynamic properties, physicochemical properties, chemical and biological activity of chemical graphs Methods: At first, vertex sets have been partitioned on the basis of their degrees, eccentricities and frequencies of occurrence. Then these partitions are used to compute the eccentricity-based indices with the aid of some combinatorics | ||
| 520 | |a RESULTS: The total eccentric index and eccentric-connectivity index have been computed. We also compute some eccentricity-based Zagreb indices of the Sierpinski networks. Moreover, a comparison has also been presented in the form of graphs | ||
| 520 | |a CONCLUSION: These computations will help the readers to estimate the thermodynamic properties and physicochemical properties of chemical structure which are of fractal nature and can not be dealt with easily. A 3D graphical representation is also presented to understand the dynamics of the aforementioned topological descriptors | ||
| 650 | 4 | |a Journal Article | |
| 650 | 4 | |a Research Support, Non-U.S. Gov't | |
| 650 | 4 | |a Topological indices | |
| 650 | 4 | |a Zagrib indices | |
| 650 | 4 | |a chemical graphs. | |
| 650 | 4 | |a eccentricity | |
| 650 | 4 | |a molecular descriptors | |
| 650 | 4 | |a sierpinski graphs | |
| 700 | 1 | |a Rafiullah, Muhammad |e verfasserin |4 aut | |
| 700 | 1 | |a Siddiqui, Hafiz Muhammad Afzal |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Combinatorial chemistry & high throughput screening |d 1998 |g 25(2022), 3 vom: 04., Seite 568-578 |w (DE-627)NLM097489352 |x 1875-5402 |7 nnns |
| 773 | 1 | 8 | |g volume:25 |g year:2022 |g number:3 |g day:04 |g pages:568-578 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.2174/1386207324666210713114755 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 25 |j 2022 |e 3 |b 04 |h 568-578 | ||