scientific article; zbMATH DE number 871170

MaRDI QIDQ4874588zbMATH OpenFDO

Authors Ashok T. Amin, Peter Slater

Publication date 20 August 1996

zbMATH Keywords

characterizationdomination theoryparity assignmentrealizable treestrees

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75)

Recommendations

• Counting all parity realizable trees
• scientific article; zbMATH DE number 3889564
• Parity and disparity subgraphs
• scientific article; zbMATH DE number 4101253
• Combinatorial properties of a general domination problem with parity constraints

Cited in

(20)

• Parity and disparity subgraphs
• On a modular domination game.
• Parity dimension for graphs
• Lights Out for graphs related to one another by constructions
• A group-labeling version of the Lights Out game
• When an optimal dominating set with given constraints exists
• \([1,2]\)-sets in graphs
• On the complexity of dominating set problems related to the minimum all-ones problem
• Periodic binary harmonic functions on lattices
• A Survey of the Game “Lights Out!”
• Counting all parity realizable trees
• \([1,2]\)-domination in graphs
• On \([1,2]\)-domination in trees
• Lights Out On A Random Graph
• Lit-only \(\sigma \)-game on pseudo-trees
• A note on Lights-Out-puzzle: parity-state graphs
• Bounding the multiplicities of eigenvalues of graph matrices in terms of circuit rank
• 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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4874588)