arXiv (All)
open access
On $1$-limited and $(1,2)$-domination in cubic graphs
A dominating set $D$ of a graph is called $1$-limited if every vertex of $D$ has at most one neighbor outside $D$, while a $(1,2)$-dominating set is a dominating set in which every vertex of the set has at least two neighbors within the set. These two notions coincide on cubic graphs. We prove that
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
- Fundamentals of domination in graphs#1179875
- An improved lower and upper bound of the k-limited domination number#1156714
- Spanning subhypergraphs with degree constraints#1109177
- The tree packing conjecture for trees of almost linear maximum degree#986755
- Ramsey properties of maximal (outer)planar graphs#972204
Record · ID 1157067
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