Parity Dimension for Graphs - A Linear Algebraic Approach
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Characterizing switch-setting problems∗
- Inseparable orthogonal matrices over \(\mathbb{Z}_2\)
- Linear cellular automata and the garden-of-eden
- Parity dimension for graphs
- \(\sigma\)-Automata and Chebyshev-polynomials
Cited in
(10)- Random Lights Out processes on graphs
- Lights Out for graphs related to one another by constructions
- Parity dimension for graphs
- A group-labeling version of the Lights Out game
- Periodic harmonic functions on lattices and points count in positive characteristic
- Effects of edge addition or removal on the nullity of a graph
- Counting all parity realizable trees
- Minimum light number of lit-only \(\sigma\)-game on a tree
- Periodic binary harmonic functions on lattices
- Combinatorial properties of a general domination problem with parity constraints
This page was built for publication: Parity Dimension for Graphs - A Linear Algebraic Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796507)
