✦ LIBER ✦

Partitions into two Lehmer numbers

✍ Scribed by Igor E. Shparlinski; Arne Winterhof

Publisher: Springer Vienna
Year: 2009
Tongue: English
Weight: 158 KB
Volume: 160
Category: Article
ISSN: 0026-9255
DOI: 10.1007/s00605-009-0130-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitions involving D.H. Lehmer numbers

✍ Yaming Lu; Yuan Yi 📂 Article 📅 2008 🏛 Springer Vienna 🌐 English ⚖ 149 KB

On a Problem of Lehmer on Partitions int

On a Problem of Lehmer on Partitions into Squares

✍ Michael D. Hirschhorn; James A. Sellers 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 88 KB

Partitions of bi-partite numbers into at

Partitions of bi-partite numbers into at mostjparts

✍ Bruce M. Landman; Ezra A. Brown; Frederick J. Portier 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 304 KB

Minimum perimeter partitions of the plan

Minimum perimeter partitions of the plane into equal numbers of regions of two different areas

✍ M.A. Fortes; P.I.C. Teixeira 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 156 KB

On the number of partitions into primes

✍ R. C. Vaughan 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 316 KB

Partitioning a graph into two isomorphic

Partitioning a graph into two isomorphic pieces

✍ Anthony Bonato; Richard Nowakowski 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract A simple graph __G__ has the neighbour‐closed‐co‐neighbour property, or ncc property, if for all vertices __x__ of __G__, the subgraph induced by the set of neighbours of __x__ is isomorphic to the subgraph induced by the set of non‐neighbours of __x__. We present characterizations of g