K-Narayana sequence self-Similarity. flip graph views of k-Narayana self-Similarity

Engin Özkan, Bahar Kuloǧlu and James F. Peters

Chaos, Solitons & Fractals, 2021, vol. 153, issue P2

Abstract: This paper introduces self-similarity inherent in planar Milich-Jennings centered flip graphs derived from the Narayana sequence. We show that self-similarity found in a Narayana sequence yields a connected spanning subgraph with a centered flip. This paper has several main results (1) Every Narayana sequence constructs a flip graph, (2) Every Narayana sequence is self-similar and (3) Every Pascal 3-triangle has a free group presentation.

Keywords: Flip graphs; K-Narayana sequence; Pascal 3-triangle; Planar graph; Self-Similarity (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077921008274
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:153:y:2021:i:p2:s0960077921008274

DOI: 10.1016/j.chaos.2021.111473

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. ().