𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of digital straight lines on an N×N grid

✍ Scribed by Koplowitz, J.; Lindenbaum, M.; Bruckstein, A.

Book ID
114540403
Publisher
IEEE
Year
1990
Tongue
English
Weight
565 KB
Volume
36
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The domination numbers of the 5 × n and
The domination numbers of the 5 × n and 6 × n grid graphs
✍ Tony Yu Chang; W. Edwin Clark 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 745 KB

## Abstract The __k__ × __n__ grid graph is the product __P__~__k__~ × __P__~__n__~ of a path of length __k__ − 1 and a path of length __n__ − 1. We prove here formulas found by E. O. Hare for the domination numbers of __P__~5~ × __P__~__n__~ and __P__~6~ × __P__~__n__~. © 1993 John Wiley & Sons, I

On the irregularity strength of the m ×
On the irregularity strength of the m × n grid
✍ Jeffrey H. Dinitz; David K. Garnick; Andras Gyárfás 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 939 KB

## Abstract Given a graph __G__ with weighting __w__: __E__(__G__) ← __Z__^+^, the __Strength__ of __G__(__w__) is the maximum weight on any edge. The __sum__ of a vertex in __G__(__w__) is the sum of the weights of all its incident edges. The network __G__(__w__) is __irregular__ if the vertex sum