The edge-centered surface area of the arrangement graph

Eddie Cheng (), Ke Qiu () and Zhizhang Shen ()
Additional contact information
Eddie Cheng: Oakland University
Ke Qiu: Brock University
Zhizhang Shen: Plymouth State University

Journal of Combinatorial Optimization, 2014, vol. 27, issue 1, No 5, 49-64

Abstract: Abstract We suggest the notion of the edge-centered surface area for an interconnection network, which generalizes the usual notion of surface area of a network centered at a vertex. Following an elementary approach, we derive an explicit formula expression of the edge-centered surface area for the general arrangement graph.

Keywords: Edge-centered surface area; Arrangement graph; Combinatorial studies; Interconnection networks; Parallel computing (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9590-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:27:y:2014:i:1:d:10.1007_s10878-012-9590-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9590-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().