Parity dimension for graphs

DOI10.1016/S0012-365X(97)00242-2zbMath0957.05058MaRDI QIDQ1584295

Ashok T. Amin, Peter J. Slater, Lane H. Clark

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

random graphsadjacency matrixtreesneighborhood matrix

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (12)

Parity Dimension for Graphs - A Linear Algebraic Approach ⋮ Random Lights Out processes on graphs ⋮ On a modular domination game. ⋮ A note on Lights-Out-puzzle: parity-state graphs ⋮ On the complexity of dominating set problems related to the minimum all-ones problem ⋮ On weak odd domination and graph-based quantum secret sharing ⋮ A group-labeling version of the Lights Out game ⋮ Minimum light number of lit-only \(\sigma\)-game on a tree ⋮ Combinatorial properties of a general domination problem with parity constraints ⋮ A solitaire game played on 2-colored graphs ⋮ Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs ⋮ A Survey of the Game “Lights Out!”

Cites Work

• Introduction to ``Topics on Domination
• Enumeration of labelled multigraphs by degree parities
• Linear cellular automata and the garden-of-eden
• A linear algorithm for a core of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parity dimension for graphs