[id] => 207
[recorddate] => 2010:11:07:14:37:42
[lastupdate] => 2010:11:07:14:37:42
[type] => article
[place] => Targu Jiu, Romania
[subject] => chemistry - organic; informatics - simulation; mathematics - modeling; mathematics - number theory; mathematics - probability theory; mathematics - statistics
[relatedworks] =>
• 3 (low):
  • Observation vs. observable: maximum likelihood estimations according to the assumption of generalized Gauss and Laplace distributions, ?id=206
  • The relationship between energy calculations and boiling points of n-alkanes, ?id=231
  • Diagnostic of a QSPR model: aqueous solubility of drug-like compounds, ?id=232
[file] => ?f=207
[mime] => application/pdf
[size] => 287108
[pubname] => Surveys in Mathematics and its Applications
[pubinfo] => University Constantin Brâncuşi of Târgu-Jiu
[pubkey] => ISSN 1843-7265, eISSN 1842-6298
[workinfo] => 4: 168-176
[year] => 2009
[title] => Entropy due to fragmentation of dendrimers
[authors] => Lorentz JÄNTSCHI, Sorana D. BOLBOACĂ
[abstract] =>
Subgraphs can results through application of criteria based on matrix which characterize the entire graph. The most important categories of criteria are the ones able to produce connected subgraphs (fragments). Based on theoretical frame on graph theory, the fragmentation algorithm on pair of vertices containing the largest fragments (called MaxF) are exemplified. The counting polynomials are used to enumerate number of all connected substructures and their sizes. For a general class of graphs called dendrimers general formulas giving counting polynomials are obtained and characterized using informational measures.
[keywords] => Graph theory; Subgraphs; Graph polynomials; Entropy
[acknowledgment] => The authors would like to thank Prof. M. V. Diudea for the helpful discussions related to counting polynomials.