Neighbor connectivity of hierarchical pancake networks

Yu Fang and Yingzhi Tian

Applied Mathematics and Computation, 2025, vol. 507, issue C

Abstract: The vertex neighbor connectivity is the least number of vertices in an interconnection network G, if remove whose closed neighborhoods, the network will become empty, complete, or disconnected; the edge neighbor connectivity is the least number of edges in G, if remove whose ends, the network will become empty, trivial, or disconnected. In this paper, we investigate the neighbor connectivity of hierarchical pancake networks HPn, which is a two level network by using the pancake graphs as the fundamental blocks. And we show that, for n≥3, the vertex and edge neighbor connectivity of HPn are n−1 and n, respectively.

Keywords: Hierarchical pancake network; Extra connectivity; Vertex neighbor connectivity; Edge neighbor connectivity (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325003297
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:apmaco:v:507:y:2025:i:c:s0096300325003297

DOI: 10.1016/j.amc.2025.129603

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().