Academic Journals Database
Disseminating quality controlled scientific knowledge

Graph Theory. 1. Fragmentation of Structural Graphs

ADD TO MY LIST
 
Author(s): Lorentz JÄNTSCHI

Journal: Leonardo Electronic Journal of Practices and Technologies
ISSN 1583-1078

Volume: 1;
Issue: 1;
Start page: 19;
Date: 2002;
Original page

Keywords: Graph theory | Graph fragmentation | Vertex descriptors | Molecular topology | Graph coloring | Graph partitioning

ABSTRACT
The investigation of structural graphs has many fields of applications in engineering, especially in applied sciences like as applied chemistry and physics, computer sciences and automation, electronics and telecommunication. The main subject of the paper is to express fragmentation criteria in graph using a new method of investigation: terminal paths. Using terminal paths are defined most of the fragmentation criteria that are in use in molecular topology, but the fields of applications are more generally than that, as I mentioned before. Graphical examples of fragmentation are given for every fragmentation criteria. Note that all fragmentation is made with a computer program that implements a routine for every criterion.[1] A web routine for tracing all terminal paths in graph can be found at the address: http://vl.academicdirect.ro/molecular_topology/tpaths/ [1] M. V. Diudea, I. Gutman, L. Jäntschi, Molecular Topology, Nova Science, Commack, New York, 2001, 2002.
     Get a faster system with an easy scan today!