arXiv (All)
open access
On $k$-limited domination: complexity and Sierpiński graphs
A dominating set $D$ of a graph $G$ is called $k$-limited if every vertex of $D$ has at most $k$ neighbors outside $D$. The minimum cardinality among all $k$-limited dominating sets of $G$ is the $k$-limited domination number, denoted by $γ_k^L(G)$. In this paper, we prove that the $1$-Limited Dom
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
- On $k$-limited domination: complexity and Cartesian products#1156397
- A note on efficient k-limited broadcast domination in graphs#659009
- A note on efficient k-limited broadcast domination in graphs#656873
- Dominated Coloring of Some Classes of Perfect and Unicyclic Graphs#1116770
- Ordered Ramsey numbers of 3-uniform hypergraphs with bounded weak degeneracy#1122769
Record · ID 1156855
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