arXiv (All)
open access
An improved lower and upper bound of the k-limited domination number
We continue the study of $k$-limited domination in graphs, a domination variant in which each vertex of a dominating set may dominate at most $k$ vertices outside the set. This concept extends classical domination by incorporating capacity constraints on dominating vertices. We improve the general
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
- Paired Disjunctive Domination Number of Middle Graphs#1012030
- On $1$-limited and $(1,2)$-domination in cubic graphs#1157067
- Domination Parameters of Graph Covers#1037704
- Minimum-excess coverings of complete graphs by 3-, 4-, and 5-cliques#1142646
Record · ID 1156714
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