On permutation graphs | ||||
| Journal of the Egyptian Mathematical Society | ||||
| Volume 20, Issue 2, 2012, Page 57-63 PDF (1.06 MB) | ||||
| DOI: org/10.1016/j.joems.2012.08.008 | ||||
 View on SCiNiTO | ||||
| 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: 21 PDF Download: 23 |
||||
