No label defined (Q3834076)
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 4110724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4110724 |
Statements
1988
0 references
permutation graphs
0 references
Connectivity
0 references
edge-connectivity
0 references
0.8211992383003235
0 references
0.8170796036720276
0 references
0.8086382746696472
0 references
[For the entire collection see Zbl 0665.00002.] For an n-vertex labelled graph G and a permutation \(\alpha\) of degree n, the \(\alpha\)-permutation graph \(P_{\alpha}(G)\) of G consists of two copies \(G'\), \(G''\) of G, together with the edges joining vertex i of G with the vertex \(\alpha\) (i) of \(G''\) for \(i=1,2,...,n\); [see, e.g., \textit{B. Zelinka}, Mat. Časopis 23, 193-198 (1973; Zbl 0262.05109)]. Continuing his investigations into connectivity of permutation graphs (Connectivity and Hamiltonian properties of permutation graphs, Ph. D. Dissertation, Clemson University 1985), the author obtains various results concerning the edge-connectivity of permutation graphs, and determines the edge-connectivity for permutation graphs of graphs belonging to various special classes.
0 references