网(多面体)
邻接表
关系(数据库)
拓扑(电路)
序列(生物学)
节点(物理)
网络拓扑
路径(计算)
子网
图形
计算机科学
数学
组合数学
理论计算机科学
数据挖掘
物理
计算机网络
生物
遗传学
几何学
量子力学
出处
期刊:Acta Crystallographica Section A
[International Union of Crystallography]
日期:2007-06-15
卷期号:63 (4): 329-343
被引量:109
标识
DOI:10.1107/s0108767307022088
摘要
A method is proposed to search for topological relations between periodic nets. The method is based on a sequence of steps of decreasing the node degree and symmetry of the initial net (supernet) and, as a result, gives all its subnets. It is implemented into the program package TOPOS which automatically constructs the net relation graph (NRG) for a given set of initial nets. The method is used to find all supernet-subnet relations for 924 initial 4-12-coordinated uninodal nets. The resulting NRG consists of 6528 3-12-coordinated uninodal nets; 5278 of them have topologies not described earlier. It is shown that many NRG properties are useful in crystal chemistry. In particular, a path between NRG nodes corresponds to a sequence of transformations that relate the nets, the adjacency sequence of a NRG node may be used as a criterion for crystallochemical 'significance' of the corresponding net. Many well known net topologies are found to have a large number of relations with other topologies that cause their special place in the NRG and crystallochemical 'significance'. The peculiarities of the proposed approach are illustrated by examples of the nets often occurring in crystal structures.
科研通智能强力驱动
Strongly Powered by AbleSci AI