Molecular topology. VIII: Centricities in molecular graphs. The mollen algorithm
| Autor: | D. Horvath, I. E. Kacso, Mircea V. Diudea, B. Parv, Ovidiu M. Minailiuc |
|---|---|
| Rok vydání: | 1992 |
| Předmět: |
Discrete mathematics
Vertex (graph theory) Applied Mathematics General Chemistry Combinatorics chemistry.chemical_compound Indifference graph chemistry Chordal graph Molecular graph Maximal independent set Molecular topology Algorithm MathematicsofComputing_DISCRETEMATHEMATICS Hopcroft–Karp algorithm Mathematics |
| Zdroj: | Journal of Mathematical Chemistry. 11:259-270 |
| ISSN: | 1572-8897 0259-9791 |
| DOI: | 10.1007/bf01164207 |
| Popis: | Local and global centricities and corresponding complexity centricities are derived on the basis of matricesB (layer matrix of vertex degrees) by using appropriate distance operators. The MOLCEN algorithm computes these centricities by means of line derivatives (L n) of graphs. It provides reliable centric ordering of subgraphs of various length in molecular graphs. The algorithm is implemented on a TURBO-PASCAL, TOPIND program and is exemplified within a set of molecular graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink