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: | Sorana D. Bolboacă, Lorentz Jäntschi |
---|---|
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 |
Similar Items
-
Counting Polynomials on Regular Iterative Structures
by: Lorentz JÄNTSCHI, et al.
Published: (2009-12-01) -
How Good Can the Characteristic Polynomial Be for Correlations?
by: Lorentz Jantschi, et al.
Published: (2007-04-01) -
Multi-Graph Multi-Label Learning Based on Entropy
by: Zixuan Zhu, et al.
Published: (2018-04-01) -
Graphs Having Most of Their Eigenvalues Shared by a Vertex Deleted Subgraph
by: Alexander Farrugia
Published: (2021-09-01) -
On Properties of Distance-Based Entropies on Fullerene Graphs
by: Modjtaba Ghorbani, et al.
Published: (2019-05-01)