Permutation graphs with co-inversion on 1 - non-deranged permutations
Keywords:
Permutation graphs, -non-deranged permutations, co-Inversion,, completed graphs, simple graphs.Abstract
In this paper, we define permutation graphs on 1 -non-deranged
permutations using the set of co-inversion as edge set, and the values of
permutation as the set of vertices. From the graphs, we observed that
diameter and radius of the graph of any 1 is one, the graph of any
1
p 1 p G
is simple, the graph of 1 is completed and other properties of
the graphs were also observed
Downloads
Published
02/24/2023
Issue
Section
Articles
How to Cite
Permutation graphs with co-inversion on 1 - non-deranged permutations. (2023). CaJoST, 5(2), 127-131. https://cajost.com.ng/index.php/files/article/view/143
