1991
DOI: 10.1016/0022-3093(91)90145-v
|View full text |Cite
|
Sign up to set email alerts
|

Properties and efficient algorithmic determination of different classes of rings in finite and infinite polyhedral networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
69
0

Year Published

1992
1992
2022
2022

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 100 publications
(69 citation statements)
references
References 7 publications
0
69
0
Order By: Relevance
“…The largest rings are 24-rings (in net 26). Strong rings (Goetzke & Klien, 1991) are those which cannot be decomposed into sums of smaller circuits. The largest of these are the 20-rings occurring in net 25.…”
Section: Discussionmentioning
confidence: 99%
“…The largest rings are 24-rings (in net 26). Strong rings (Goetzke & Klien, 1991) are those which cannot be decomposed into sums of smaller circuits. The largest of these are the 20-rings occurring in net 25.…”
Section: Discussionmentioning
confidence: 99%
“…Rings have been variously called 'fundamental circuits', 'primitive rings' and 'fundamental rings' by other authors. Goetzke & Klien (1991) (Marians & Hobbs, 1990;Stixrude & Bukowinski, 1990;Goetzke & Klien, 1991).…”
Section: Terminologymentioning
confidence: 99%
“…[1,2,9,10,11,12,13,14,15,16,17]. These methods do not restrict the number of atoms to be considered, and are useful to classify the variety of many-body atomic structure in certain situations.…”
Section: Introductionmentioning
confidence: 99%