Medha Itagi Huilgol, P HShobha HShobha, H Jayakrishna Udupa, Ismail Naci Cangul
{"title":"Steiner 3-Wiener Index of Zigzag Polyhex Nanotubes.","authors":"Medha Itagi Huilgol, P HShobha HShobha, H Jayakrishna Udupa, Ismail Naci Cangul","doi":"10.2174/0113862073329237240929214731","DOIUrl":null,"url":null,"abstract":"<p><strong>Background: </strong>Let G be a connected graph and S be a k element subset of the vertex set V(G) of G. Steiner distance is a natural generalization of the usual graph distance. The Steiner-k distance dG(S) between the vertices of S is the minimum size among all connected subgraphs whose vertex set contains S. The generalized indices based on Steiner distances have several applications in the real world. It is a well-known fact that \"Steiner Problem\" is NP-complete and hence any parameter based on Steiner distance is also an NP problem.</p><p><strong>Objective: </strong>The objective of this work is to determine the Steiner 3-Wiener index for an important chemical structure called the zigzag polyhex nanotube.</p><p><strong>Methods: </strong>In this paper, we present an algorithm for computing the Steiner 3-Wiener index (SW3) for zigzag polyhex nanotubes. The developed algorithm addresses the complexities associated with exponential increments in the number of vertices as the nanotube's circumference or length expands. The obtained SW3 values for zigzag polyhex nanotubes can be used for Quantitative Structure-Activity Relationship (QSAR) and Quantitative Structure-Property Relationship (QSPR) analyses.</p><p><strong>Results: </strong>We have presented an algorithm and listed the numerical values of SW3 for various parameters of circumference and length of a zigzag polyhex nanotube to facilitate their utilization in QSAR/ QSPR analyses. We have obtained the time complexity for the algorithm, which shows that the SW3 values are computationally intensive. To explain this complex nature, we have used multiple linear regression to fit log SW3 values corresponding to log p and log q, the radius and length of a nanotube.</p><p><strong>Conclusion: </strong>The algorithm addresses the complexities associated with the exponential increase in vertices as the nanotube's circumference or length expands. Furthermore, we provide SW3 values for various parameter combinations up to circumference or length 17, and a general relation to determine the value of SW3, facilitating its utilization in real-world applications. These values serve as crucial descriptors for understanding the structural nuances of zigzag polyhex nanotubes, that find applications in material science, drug design, drug discovery, etc.</p>","PeriodicalId":10491,"journal":{"name":"Combinatorial chemistry & high throughput screening","volume":null,"pages":null},"PeriodicalIF":1.6000,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorial chemistry & high throughput screening","FirstCategoryId":"3","ListUrlMain":"https://doi.org/10.2174/0113862073329237240929214731","RegionNum":4,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"BIOCHEMICAL RESEARCH METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Background: Let G be a connected graph and S be a k element subset of the vertex set V(G) of G. Steiner distance is a natural generalization of the usual graph distance. The Steiner-k distance dG(S) between the vertices of S is the minimum size among all connected subgraphs whose vertex set contains S. The generalized indices based on Steiner distances have several applications in the real world. It is a well-known fact that "Steiner Problem" is NP-complete and hence any parameter based on Steiner distance is also an NP problem.
Objective: The objective of this work is to determine the Steiner 3-Wiener index for an important chemical structure called the zigzag polyhex nanotube.
Methods: In this paper, we present an algorithm for computing the Steiner 3-Wiener index (SW3) for zigzag polyhex nanotubes. The developed algorithm addresses the complexities associated with exponential increments in the number of vertices as the nanotube's circumference or length expands. The obtained SW3 values for zigzag polyhex nanotubes can be used for Quantitative Structure-Activity Relationship (QSAR) and Quantitative Structure-Property Relationship (QSPR) analyses.
Results: We have presented an algorithm and listed the numerical values of SW3 for various parameters of circumference and length of a zigzag polyhex nanotube to facilitate their utilization in QSAR/ QSPR analyses. We have obtained the time complexity for the algorithm, which shows that the SW3 values are computationally intensive. To explain this complex nature, we have used multiple linear regression to fit log SW3 values corresponding to log p and log q, the radius and length of a nanotube.
Conclusion: The algorithm addresses the complexities associated with the exponential increase in vertices as the nanotube's circumference or length expands. Furthermore, we provide SW3 values for various parameter combinations up to circumference or length 17, and a general relation to determine the value of SW3, facilitating its utilization in real-world applications. These values serve as crucial descriptors for understanding the structural nuances of zigzag polyhex nanotubes, that find applications in material science, drug design, drug discovery, etc.
期刊介绍:
Combinatorial Chemistry & High Throughput Screening (CCHTS) publishes full length original research articles and reviews/mini-reviews dealing with various topics related to chemical biology (High Throughput Screening, Combinatorial Chemistry, Chemoinformatics, Laboratory Automation and Compound management) in advancing drug discovery research. Original research articles and reviews in the following areas are of special interest to the readers of this journal:
Target identification and validation
Assay design, development, miniaturization and comparison
High throughput/high content/in silico screening and associated technologies
Label-free detection technologies and applications
Stem cell technologies
Biomarkers
ADMET/PK/PD methodologies and screening
Probe discovery and development, hit to lead optimization
Combinatorial chemistry (e.g. small molecules, peptide, nucleic acid or phage display libraries)
Chemical library design and chemical diversity
Chemo/bio-informatics, data mining
Compound management
Pharmacognosy
Natural Products Research (Chemistry, Biology and Pharmacology of Natural Products)
Natural Product Analytical Studies
Bipharmaceutical studies of Natural products
Drug repurposing
Data management and statistical analysis
Laboratory automation, robotics, microfluidics, signal detection technologies
Current & Future Institutional Research Profile
Technology transfer, legal and licensing issues
Patents.