Parity Dimension for Graphs - A Linear Algebraic Approach

DOI10.1080/0308108021000049293zbMath1023.05095OpenAlexW1975892062MaRDI QIDQ4796507

Ashok T. Amin, Guo-Hui Zhang, Peter J. Slater

Publication date: 17 March 2003

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0308108021000049293

zbMATH Keywords

adjacency matrix

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Lights Out for graphs related to one another by constructions ⋮ Random Lights Out processes on graphs ⋮ A group-labeling version of the Lights Out game ⋮ Periodic binary harmonic functions on lattices ⋮ Minimum light number of lit-only \(\sigma\)-game on a tree ⋮ Combinatorial properties of a general domination problem with parity constraints ⋮ Periodic harmonic functions on lattices and points count in positive characteristic

Cites Work

• Unnamed Item
• Unnamed Item
• Inseparable orthogonal matrices over \(\mathbb{Z}_2\)
• Parity dimension for graphs
• Linear cellular automata and the garden-of-eden
• \(\sigma\)-Automata and Chebyshev-polynomials
• Characterizing switch-setting problems^∗

This page was built for publication: Parity Dimension for Graphs - A Linear Algebraic Approach