Counting Polynomials on Regular Iterative Structures

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). Theoretical frame on graph theory, a series of three molecular fragmentation algorithms o...

Full description

Bibliographic Details
Main Authors: Lorentz JÄNTSCHI, Mugur C. BĂLAN, Sorana D. BOLBOACĂ
Format: Article
Language:English
Published: Iuliu Hatieganu University of Medicine and Pharmacy, Cluj-Napoca 2009-12-01
Series:Applied Medical Informatics
Subjects:
Online Access:http://ami.info.umfcluj.ro/Full-text/AMI_24_2009/AMI(24)_067_095.pdf