103 search results - page 1 / 21 » Representations of graphs modulo n |
DM
2000
13 years 4 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
ARITH
2009
IEEE
13 years 11 months ago
2009
IEEE
Moduli of the form 2n ± 1, which greatly simplify certain arithmetic operations in residue number systems (RNS), have been of longstanding interest. A steady stream of designs fo...
SIAMDM
2010
12 years 11 months ago
2010
Let (Cd m) denote the graph whose set of vertices is Zd m in which two distinct vertices are adjacent iff in each coordinate either they are equal or they differ, modulo m, by at
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
This paper is devoted to the study of number representations and algorithms leading to efficient implementations of modular adders and multipliers on recent Field Programmable Ar...
TIT
2008
13 years 4 months ago
2008
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...