On permutation graphs
Seoud, M., Mahran, A. (2012). On permutation graphs. EKB Journal Management System, 20(2), 57-63. doi: org/10.1016/j.joems.2012.08.008
M. A. Seoud; A. E.A. Mahran. "On permutation graphs". EKB Journal Management System, 20, 2, 2012, 57-63. doi: org/10.1016/j.joems.2012.08.008
Seoud, M., Mahran, A. (2012). 'On permutation graphs', EKB Journal Management System, 20(2), pp. 57-63. doi: org/10.1016/j.joems.2012.08.008
Seoud, M., Mahran, A. On permutation graphs. EKB Journal Management System, 2012; 20(2): 57-63. doi: org/10.1016/j.joems.2012.08.008

On permutation graphs

Journal of the Egyptian Mathematical Society
Volume 20, Issue 2, 2012, Pages 57-63    PDF (1.06 M)
DOI: org/10.1016/j.joems.2012.08.008
Authors
M. A. Seoud* ; A. E.A. Mahran
Department of Mathematics, Faculty of science, Ain Shams university, Abbassia, Cairo, Egypt
Abstract
We give an upper bound of the number of edges of a permutation graph. We introduce some necessary conditions for a graph to be a permutation graph, and we discuss the independence
of these necessary conditions. We show that they are altogether not sufficient for a graph to be a
permutation graph.
Keywords
Permutation graph; Graph labeling
Statistics
Article View: 28
PDF Download: 29