Open AccessOn permutation graphs
Author(s) -
M. A. Seoud,
A. E. A. Mahran
Publication year - 2012
Publication title -
journal of the egyptian mathematical society
Language(s) - English
Resource type - Journals
eISSN - 2090-9128
pISSN - 1110-256X
DOI - 10.1016/j.joems.2012.08.008
Subject(s) - permutation graph , mathematics , combinatorics , discrete mathematics , line graph , graph , cyclic permutation , null graph , voltage graph , symmetric group
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom