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 |
| id |
doaj-a5254a858f744a7f83b5bf588ca74758 |
|---|---|
| record_format |
Article |
| spelling |
doaj-a5254a858f744a7f83b5bf588ca747582020-11-25T02:01:55ZengSpringerOpenJournal of the Egyptian Mathematical Society1110-256X2012-07-01202576310.1016/j.joems.2012.08.008On permutation graphsM.A. SeoudA.E.A. MahranWe 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.http://www.sciencedirect.com/science/article/pii/S1110256X12000235Permutation graphGraph labeling |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
M.A. Seoud A.E.A. Mahran |
| spellingShingle |
M.A. Seoud A.E.A. Mahran On permutation graphs Journal of the Egyptian Mathematical Society Permutation graph Graph labeling |
| author_facet |
M.A. Seoud A.E.A. Mahran |
| author_sort |
M.A. Seoud |
| title |
On permutation graphs |
| title_short |
On permutation graphs |
| title_full |
On permutation graphs |
| title_fullStr |
On permutation graphs |
| title_full_unstemmed |
On permutation graphs |
| title_sort |
on permutation graphs |
| publisher |
SpringerOpen |
| series |
Journal of the Egyptian Mathematical Society |
| issn |
1110-256X |
| publishDate |
2012-07-01 |
| description |
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. |
| topic |
Permutation graph Graph labeling |
| url |
http://www.sciencedirect.com/science/article/pii/S1110256X12000235 |
| work_keys_str_mv |
AT maseoud onpermutationgraphs AT aeamahran onpermutationgraphs |
| _version_ |
1724955090519851008 |