Beta
ManageSearchChatDiscover
387212

On permutation labeling

Article

Last updated: 21 Dec 2024

OverviewSimilar Items

Subjects

-

Tags

-

Abstract

We determine all permutation graphs of order 69. We prove that every bipartite graph of order 650 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''.

DOI

10.1016/j.joems.2011.10.006

Authors

First Name

M.

Last Name

Seoud

MiddleName

A.

Affiliation

Department of Mathematics, Faculty of Science, Ain Shams University, Abbassia, Cairo, Egypt

Email

m.a.seoud@hotmail.com

City

-

Orcid

-

First Name

M.

Last Name

Salim

MiddleName

A.

Affiliation

-

Email

mahersalima@yahoo.com

City

-

Orcid

-

Volume

19

Article Issue

3

Related Issue

50533

Issue Date

2011-09-01

Receive Date

2024-10-20

Publish Date

2011-09-01

Page Start

134

Page End

136

Print ISSN

1110-256X

Online ISSN

2090-9128

Article File

JOEMS_Volume 19_Issue 3_Pages 134-136.pdf

PDF . 325.1kB

Link

https://joems.journals.ekb.eg/article_387212.html

Detail API

https://joems.journals.ekb.eg/service?article_code=387212

Order

387,212

Publication Type

Journal

Publication Title

Journal of the Egyptian Mathematical Society

Publication Link

https://joems.journals.ekb.eg/

MainTitle

On permutation labeling

Details

Type

Article

Created At

21 Dec 2024