• Corpus ID: 11517404

Nowhere 0 mod p dominating sets in multigraphs

@article{Yuster2004Nowhere0M,
  title={Nowhere 0 mod p dominating sets in multigraphs},
  author={Raphael Yuster},
  journal={Ars Comb.},
  year={2004},
  volume={70}
}
Let G be a graph with integral edge weights. A function d : V (G) → Zp is called a nowhere 0 mod p domination function if each v ∈ V satisfies ( d(v) + ∑ u∈N(v) w(u, v)d(u) ) 6= 0 mod p, where w(u, v) denotes the weight of the edge (u, v) and N(v) is the neighborhood of v. The subset of vertices with d(v) 6= 0 is called a nowhere 0 mod p dominating set. It is known that every graph has a nowhere 0 mod 2 dominating set. It is known to be false for all other primes p. The problem is open for all… 
1 Citations
A counterexample to the lights out problem

References

SHOWING 1-5 OF 5 REFERENCES
Graph Theory with Applications
TLDR
The burgeoning of Graph Theory was first aware when I studied the 1940 paper of Brooks, Smith, Stone and Tutte in the Duke Mathematical Journal, ostensibly on squared rectangles, all in the Quest of the Perfect Square.
Linear cellular automata and the garden-of-eden
TLDR
A solution to the All-Ones Problem can be described by a subset of all squares (namely a set of squares whose buttons when pressed in an arbitrary order will render all lights on) rather than a sequence.
Simple proffs to three parity theorems
On non-z(modk) dominating sets, submit- ted
  • On non-z(modk) dominating sets, submit- ted
GRAPHNET graph theory network
  • GRAPHNET graph theory network