%0 Journal Article
%T Entropy due to Fragmentation of Dendrimers
%A Lorentz J£¿ntschi
%A Sorana D. Bolboac£¿
%J Surveys in Mathematics and its Applications
%D 2009
%I University Constantin Brancusi of Targu-Jiu
%X 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.
%K Graph theory
%K Subgraphs
%K Graph polynomials
%K Entropy.
%U http://www.utgjiu.ro/math/sma/v04/p14.pdf