Given a graph G = (V,E), a subset D ⊆ V is called a dominating set if each vertex υ ∈ V either belongs to D or is adjacent to some vertex in D. The typical objective is to find a dominating set of ...

Ask the publishers to restore access to 500,000+ books. An icon used to represent a menu that can be toggled by interacting with this icon. A line drawing of the Internet Archive headquarters building ...

The recent discussion about the consistency of arithmetic made me want to brush up on my logic. I’d like to learn a bit about axioms for arithmetic that are weaker than Peano arithmetic. The most ...