[id] => 16
[recorddate] => 2007:01:12:20:39:48
[lastupdate] => 2007:01:12:20:39:48
[type] => article
[place] => www, Internet
[subject] => chemistry - computational; informatics - fundamentals; mathematics - number theory
[relatedworks] =>
• 2 (average):
  • Graph Theory. 2. Vertex Descriptors and Graph Coloring, ?id=17
  • A Formula for Vertex Cuts in b-Trees, ?id=143
• 4 (some):
  • Informational Entropy of b-ary Trees After a Vertex Cut, ?id=205
[file] => ?f=16
[mime] => application/pdf
[size] => 307224
[pubname] => Leonardo Electronic Journal of Practices and Technologies
[pubinfo] => AcademicDirect
[pubkey] => ISSN 1583-1078
[workinfo] => 1(1), p. 19-36
[year] => 2002
[title] => Graph Theory. 1. Fragmentation of Structural Graphs
[authors] => Lorentz JÄNTSCHI
[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/
References
[1] M. V. Diudea, I. Gutman, L. Jäntschi, 'Molecular Topology', Nova Science, Commack, New York, 2002.
[keywords] => Graph theory; Graph fragmentation; Vertex descriptors; Molecular topology; Graph coloring; Graph partitioning