Length two path-centred surface areas for the arrangement graph

摘要

We suggest the notion of H-centred 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-centred surface areas of the general and scalable arrangement graph.