Author/Authors :
Ashok T. Amin، نويسنده , , Lane H. Clark، نويسنده , , Peter J. Slater، نويسنده ,
Abstract :
For a graph G = (V,E), by N = A + I, we denote the closed neighborhood matrix of G where A and I are the adjacency matrix of G and identity matrix, respectively. The parity dimension of G, denoted PD(G), is the dimension of the null space of N over the field Z2. We investigate parity dimension for trees, graphs and random graphs.
