| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 483628 | Journal of the Egyptian Mathematical Society | 2012 | 7 Pages |
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
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
M.A. Seoud, A.E.A. Mahran,