Entropy due to Fragmentation of Dendrimers
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 vertic...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University Constantin Brancusi of Targu-Jiu
2009-12-01
|
| Series: | Surveys in Mathematics and its Applications |
| Subjects: | |
| Online Access: | http://www.utgjiu.ro/math/sma/v04/p14.pdf |
| Summary: | 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. |
|---|---|
| ISSN: | 1843-7265 1842-6298 |