Title of article
Parity dimension for graphs Original Research Article
Author/Authors
Ashok T. Amin، نويسنده , , Lane H. Clark، نويسنده , , Peter J. Slater، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
17
From page
1
To page
17
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.
Journal title
Discrete Mathematics
Serial Year
1998
Journal title
Discrete Mathematics
Record number
951064
Link To Document