On the folding of graphs-theory and application

S.I. Nada and E.H. Hamouda

Chaos, Solitons & Fractals, 2009, vol. 42, issue 2, 669-675

Abstract: In this article, we recall the definition of graph folding in the sense of El-kholy and El-Esawy [El-kholy E, El-Esawy A. Graph folding of some special graphs. J Math Stat 2005;1(1):66–70.] and study the limit of folding of some graphs. Also we define the folding number and give a formula to compute the number of folding maps f:Pn→Pn, where Pn is a path with n edges. We also discuss application of folding from Orgami to buckling and high energy physics.

Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077909000435
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:42:y:2009:i:2:p:669-675

DOI: 10.1016/j.chaos.2009.01.038

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().