The coordination sequence of a graph measures how many vertices the graph has at each distance from a fixed vertex and is a generalization of the coordination number. Here it is proved that the coordination sequence of the graph obtained from a crystal is of quasi‐polynomial type, as had been postulated by Grosse‐Kunstleve et al. [Acta Cryst. (1996), A52, 879–889].

中文翻译：

---

晶体的配位序列为准多项式

图的协调序列可衡量该图在距固定顶点的每个距离处具有多少个顶点，并且是对协调数的概括。这证明了从晶体中获得的图的配位序列是准多项式的，正如Grosse-Kunstleve等人的假设。[ Acta Cryst。（1996），A 52，879-889]。