|
|||||
|
|
Deriving length two path centered surface area for the arrangement graph: a generating function approach |
|
| Authors: | Eddie Cheng Ke Qiu Zhizhang Shen |
| Affiliation: | 1. Department of Mathematics and Statistics, Oakland University, Rochester, MI, 48309-4401, USA 2. Department of Computer Science, Brock University, St. Catharines, ON, L2S 3A1, Canada 3. Department of Computer Science and Technology, Plymouth State University, Plymouth, NH, 03264-1595, USA |
| Abstract: | We discuss the notion of \(H\) -centered surface area of a graph \(G\) , where \(H\) is a subgraph of \(G\) , i.e., the number of vertices in \(G\) at a certain distance from \(H\) , and focus on the special case when \(H\) is a length two path to derive an explicit formula for the length two path centered surface area of the general and scalable arrangement graph, following a generating function approach. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |