Showing a limited preview of this publication:
Abstract
The coordination sequence sΛ(k) of a graph Λ counts the number of its vertices which have distance k from a given vertex, where the distance between two vertices is defined as the minimal number of bonds in any path connecting them. For a large class of graphs, including in particular the classical root lattices, we present the coordination sequences and their generating functions, summarizing and extending recent results of Conway and Sloane [1].
Published Online: 2010-7-28
Published in Print: 1997-4-1
© 2015 Oldenbourg Wissenschaftsverlag GmbH, Rosenheimer Str. 145, 81671 München
