## On centrally symmetric graphs.(English)Zbl 0863.06009

If $$L$$ is a finite graded lattice with $$n$$ atoms such that its dual lattice $$L^\star$$ is strong and if its covering graph is centrally symmetric, then $$L$$ is isomorphic to $$2^n$$. This result is proved using a similar result of B. Zelinka which holds for a finite modular lattice with $$n$$ atoms.

### MSC:

 06C10 Semimodular lattices, geometric lattices 05C99 Graph theory
Full Text: