Coordination sequences for root lattices and related graphs

Details Coordination sequences for root lattices and related graphs Coordination sequences for root lattices and related graphs

1997-06-12

arxiv.org/abs/cond-mat/9706122v1

Zeitschrift f. Kristallographie 212 (1997) 253-256

Physics

Condensed Matter

Statistical Mechanics

8 pages, LaTeX, 1 Postscript figure included, using epsf.sty and amssymb.sty

Scientific paper

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. A possible application to the theory of critical phenomena in lattice models is outlined.

Affiliated with

Also associated with

No associations

Rating

Coordination sequences for root lattices and related graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Coordination sequences for root lattices and related graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coordination sequences for root lattices and related graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-466529