getCITED   
  Home     Search     Add Content     Reports     Help  
Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations
Add to Bookstack | Show Bookstack | Change Bookstack

Characteristic and Counting Polynomials: Modelling Nonane Isomers Properties

Post a Comment
CONTRIBUTORS:
  Author Lorentz JÄNTSCHI (Technical University of Cluj-Napoca)
  Author Sorana D. BOLBOACA (Iuliu Hatieganu University of Medicine and Pharmacy Cluj-Napoca)
  Author Cristina M. FURDUI
JOURNAL:
  Molecular simulation, 35(3), 220 - 227.
YEAR: 2009
PUB TYPE: Journal Article
SUBJECT(S): chemistry - mathematical
DISCIPLINE: Chemistry
HTTP: http://dx.doi.org/10.1080/08927020802398892
LANGUAGE: English
PUB ID: 103-462-061 (Last edited on 2009/08/11 00:01:34 GMT-6)
SPONSOR(S):
 
ABSTRACT:
The major goal of this study was to investigate the broad application of graph polynomials to the analysis of Henry's law constants (solubility) of nonane isomers. In this context, Henry's law constants of nonane isomers were modelled using characteristic and counting polynomials. The characteristic and counting polynomials on the distance matrix (CDi), on the maximal fragments matrix (CMx), on the complement of maximal fragments matrix (CcM) and on the Szeged matrix (CSz) were calculated for each compound. One of the nonane isomers, 4-methyloctane, was identified as an outlier and was withdrawn from further analysis. This report describes the performance and characteristics of most significant models. The results showed that Henry's law constants of nonane isomers could be modelled by using characteristic polynomial and counting polynomial on the distance matrix.
STATISTICS
Click on # to view
 Citations  
 References   5 
 Comments  
 Quality      0/0.00 
 Interest      0/0.00 
 View(er)s   1/86 
Quality
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Interest
  N/A
High
  7
  6
  5
  4
  3
  2
  1
Low
Prev | Next

    ABOUT getCITED   |    CONTACT US   |    USER INFO   |    PREFERENCES   |    PRIVACY   |    LOG IN   
Comments? Suggestions? Send them to feedback@getCITED.org.

Copyright © 2000-2006 getCITED Inc. All Rights Reserved.