Title: On permutation labeling
Authors: Seoud, M.A.; Salim, M.A.
Abstract: Abstract: 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”.
Subjects: PERMUTATIONS; GRAPH labelings; PROOF theory; BIPARTITE graphs; MATHEMATICAL analysis; APPLIED mathematics
Publication: Journal of the Egyptian Mathematical Society, 2011, Vol 19, Issue 3, p134
ISSN: 1110-256X
Publication type: Academic Journal
DOI: 10.1016/j.joems.2011.10.006

On permutation labeling

Seoud, M.A.; Salim, M.A.