Back to Search
Start Over
Entropy due to Fragmentation of Dendrimers
- Source :
- Surveys in Mathematics and its Applications, Vol 4 (2009), Pp 169-177 (2009)
- Publication Year :
- 2009
- Publisher :
- University Constantin Brancusi of Targu-Jiu, 2009.
-
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.
- Subjects :
- Graph theory
Subgraphs
Graph polynomials
Entropy.
Mathematics
QA1-939
Subjects
Details
- Language :
- English, French
- ISSN :
- 18437265 and 18426298
- Volume :
- 42009)
- Database :
- Directory of Open Access Journals
- Journal :
- Surveys in Mathematics and its Applications
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.304002abfa74407bfa62c7267261818
- Document Type :
- article