No label defined (Q3315544)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3845616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3845616 |
Statements
1982
0 references
3-regular graph
0 references
cyclically n-connected
0 references
0.8667460083961487
0 references
0.8662353157997131
0 references
0.8603850603103638
0 references
0.8463587760925293
0 references
[For the entire collection see Zbl 0512.00005.] A graph G (undirected without loops) is cyclically connected if it is decomposable into two cyclic components by removing some edges. G is cyclically n-connected if such a decomposition can be obtained by removing at least n edges. In the paper the set \(S_ 5\) of all 3-regular cyclically 5-connected graphs is treated. The set \(S^ 0\!_ 5\) is exhibited (the proof is announced to be published elsewhere) which is minimal in the sense that every graph G from \(S_ 5\) can be constructed from those from \(S^ 0\!_ 5\) by consecutive applying of two operations: joining of two edges (joining the midpoints of these edges by a new edge) and joining of two parts (5-components) by 5 edges.
0 references