ManageChatDiscover
386388

On permutation graphs

Article

Last updated: 05 Jan 2025

OverviewSimilar Items

Subjects

-

Tags

-

Abstract

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.

DOI

org/10.1016/j.joems.2012.08.008

Keywords

Permutation graph, Graph labeling

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

A.

Last Name

Mahran

MiddleName

E.A.

Affiliation

Department of Mathematics, Faculty of science, Ain Shams university, Abbassia, Cairo, Egypt

Email

a.e.a.mahran@gmail.com

City

-

Orcid

-

Volume

20

Article Issue

2

Related Issue

51034

Issue Date

2012-07-01

Receive Date

2024-10-15

Publish Date

2012-07-01

Page Start

57

Page End

63

Print ISSN

1110-256X

Online ISSN

2090-9128

Article File

JOEMS_Volume 20_Issue 2_Pages 57-63.pdf

PDF . 1.1MB

Link

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

Detail API

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

Order

386,388

Publication Type

Journal

Publication Title

Journal of the Egyptian Mathematical Society

Publication Link

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

MainTitle

On permutation graphs

Details

Type

Article

Created At

21 Dec 2024