Abstract

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].

Highlights

Read more

Summary

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call