arXiv (All)
open access
Upper Domination in Rectangular Grid Graphs and Its Relation to Sub-Quorum Colorings
For a graph $G$, the upper domination number $Γ(G)$ is the maximum cardinality of a minimal dominating set. A 2023 computational study listed the upper domination number of square grid graphs among the cases for which no general formula was known. We observe that the classical equality $Γ(G)=α(G)$ f
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Vertices that belong to every minimum dominating set of a graph and their connection with transportation sharing systems with study cases in Campo de Gibraltar area#1115774
- A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set#1187809
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
- The Domination Reciprocal Mean Square Index#1234588
Record · ID 1199059
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive