Beta
ManageSearchChatDiscover
139192

Perfect folding of graphs

Article

Last updated: 23 Jan 2023

OverviewSimilar Items

Subjects

-

Tags

-

Abstract

In this paper we introduced the definition of perfect folding
of graphs and we proved that cycle graphs of even number of
edges can be perfectly folded while that of odd number of
edges can be perfectly folded to C3 . Also we proved that
wheel graphs of odd number of vertices can be perfectly
folded to C3. Finally we proved that if G is a graph of n vertices
such that 2 < clique number =chromatic number=k < n ,
then the graph can be perfectly folded to a clique of order k.

DOI

10.21608/djs.2019.139192

Keywords

Clique number, Chromatic Number, perfect graphs, graph folding

Authors

First Name

E. M.

Last Name

El-Kholy

MiddleName

-

Affiliation

Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt.

Email

-

City

-

Orcid

-

First Name

H.

Last Name

Ahmed

MiddleName

-

Affiliation

Department of Mathematics, Faculty of Shoubra Engineering , BanhaUniversity ,Egypt.

Email

-

City

-

Orcid

-

Volume

40

Article Issue

1

Related Issue

20595

Issue Date

2019-06-01

Receive Date

2021-01-13

Publish Date

2019-06-01

Page Start

30

Page End

35

Print ISSN

1012-5965

Online ISSN

2735-5306

Article File

DJS_Volume 40_Issue 1_Pages 30-35.pdf

PDF . 1.4MB

Link

https://djs.journals.ekb.eg/article_139192.html

Detail API

https://djs.journals.ekb.eg/service?article_code=139192

Order

4

Type

Research and Reference

Type Code

1,686

Publication Type

Journal

Publication Title

Delta Journal of Science

Publication Link

https://djs.journals.ekb.eg/

MainTitle

-

Details

Type

Article

Created At

23 Jan 2023