Open AccessOn permutation labeling
Author(s) -
M. A. Seoud,
M. A. Salim
Publication year - 2011
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.2011.10.006
Subject(s) - permutation graph , combinatorics , mathematics , bipartite graph , discrete mathematics , complete bipartite graph , cyclic permutation , permutation (music) , graph , symmetric group , physics , acoustics
We determine all permutation graphs of order ⩽9. We prove that every bipartite graph of order ⩽50 is a permutation graph. We convert the conjecture stating that “every tree is a permutation graph” to be “every bipartite graph is 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