On cycle permutation graphs
Cycle permutation graphs C(n,\(\alpha)\) are those permutation graphs where the underlying graph is a cycle with n vertices of which \(\alpha\) is a permutation. For some special types of cycle permutation graphs arising from certain kinds of permutations \(\alpha\) the crossing numbers are determined. Among these permutations are transpositions and cyclic permutations. The second part of the paper studies the problem of which permutations yield isomorphic permutation graphs (for the same base graph). For the so-called k-twisted prism (where the permutation is a k- cycle) all permutations yielding isomorphic cycle permutation graphs are characterized.
- A result on Hamiltonian cycles in generalized Petersen graphs
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Every generalized Petersen graph has a Tait coloring
- Generalized Petersen graphs which are cycle permutation graphs
- scientific article; zbMATH DE number 4137804 (Why is no real title available?)
- scientific article; zbMATH DE number 3654154 (Why is no real title available?)
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 3641505 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- scientific article; zbMATH DE number 3304760 (Why is no real title available?)
- scientific article; zbMATH DE number 3390826 (Why is no real title available?)
- Search for minimal trivalent cycle permutation graphs with girth nine
- The crossing numbers of some generalized Petersen graphs.
- Finding minimum dominating cycles in permutation graphs
- On natural isomorphisms of cycle permutation graphs
- Isomorphism classes of cycle permutation graphs
- How to determine the maximum genus of a graph
- Upper embeddability and connectivity of graphs
- The splicing of cycle permutation graphs
- Natural isomorphism classes of cycle permutation graphs over a graph
- Large survivable nets and the generalized prisms
- On k-complementing permutations of cyclically k-complementary graphs
- Adjacent \(q\)-cycles in permutations
- Normal 6-edge-colorings of some bridgeless cubic graphs
- Permutational powers of a graph
- scientific article; zbMATH DE number 3857124 (Why is no real title available?)
- scientific article; zbMATH DE number 3906532 (Why is no real title available?)
- scientific article; zbMATH DE number 4101209 (Why is no real title available?)
- On the classification and toughness of generalized permutation star-graphs
- scientific article; zbMATH DE number 2076912 (Why is no real title available?)
- scientific article; zbMATH DE number 777902 (Why is no real title available?)
- Spanning trails avoiding and containing given edges
- The total vertex irregularity strength for cubic graphs with a perfect matching
- Extremal permutations in routing cycles
- On the geodetic number of permutation graphs
- Generalized Petersen graphs which are cycle permutation graphs
- Connectivity of generalized prisms over G
- Chromatic automorphisms and symmetries of some graphs
- On probe permutation graphs
This page was built for publication: On cycle permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802578)
