On permutation graphs
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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2012-07-01
|
| Series: | Journal of the Egyptian Mathematical Society |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1110256X12000235 |