50
Views
10
CrossRef citations to date
0
Altmetric
Section A

On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs

, &
Pages 2903-2914 | Received 21 Jul 2008, Accepted 19 Jun 2009, Published online: 08 Oct 2010

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Eddie Cheng, Ke Qiu & Zhizhang Shen. (2014) Length two path-centred surface areas for the arrangement graph. International Journal of Computer Mathematics 91:6, pages 1170-1189.
Read now

Articles from other publishers (9)

Ethan Gibbons & Ke Qiu. (2024) A recurrence for the surface area of the (n,k)$$ \left(n,k\right) $$‐star graph. Concurrency and Computation: Practice and Experience 36:12.
Crossref
Ethan Gibbons & Ke Qiu. (2022) A Recurrence for the Surface Area of the ($n, k$)-Star Graph. A Recurrence for the Surface Area of the ($n, k$)-Star Graph.
EDDIE CHENG & OMER SIDDIQUI. (2016) Strong Matching Preclusion of Arrangement Graphs. Journal of Interconnection Networks 16:02, pages 1650004.
Crossref
Eddie Cheng, Ke Qiu & Zhizhang Shen. (2016) Length two path centered surface areas of the (n, k)-star graph. Information Sciences 332, pages 115-130.
Crossref
Eddie Cheng, Ke Qiu & Zhizhang Shen. (2014) Deriving length two path centered surface area for the arrangement graph: a generating function approach. The Journal of Supercomputing 68:3, pages 1241-1264.
Crossref
Eddie Cheng, Ke Qiu & Zhizhang Shen. (2013) The edge-centered surface area of the arrangement graph. Journal of Combinatorial Optimization 27:1, pages 49-64.
Crossref
Eddie Cheng, Jerrold W. Grossman, Ke Qiu & Zhizhang Shen. (2013) The number of shortest paths in the arrangement graph. Information Sciences 240, pages 191-204.
Crossref
Eddie Cheng, Ke Qiu & Zhizhang Shen. 2012. Combinatorial Optimization and Applications. Combinatorial Optimization and Applications 49 60 .
Eddie Cheng, Marc J. Lipman, László Lipták & David Sherman. (2011) Conditional matching preclusion for the arrangement graphs. Theoretical Computer Science 412:45, pages 6279-6289.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.