scientific article; zbMATH DE number 4110724
[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.
- On the 3-restricted edge connectivity of permutation graphs
- Distance and connectivity measures in permutation graphs
- The connectivity of generalized graph products
- Large survivable nets and the generalized prisms
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Complete edge-colored permutation graphs
- Increasing the connectivity of split-stars
- (G₁, G₂)-permutation graphs
- Highly connected star product graphs
- scientific article; zbMATH DE number 4137804 (Why is no real title available?)
- Reliability of interconnection networks modeled by Cartesian product digraphs
- scientific article; zbMATH DE number 5519216 (Why is no real title available?)
- scientific article; zbMATH DE number 4053661 (Why is no real title available?)
- Edge-connectivity of permutation hypergraphs
- On restricted connectivities of permutation graphs
- Connectivity measures in matched sum graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3834076)