arXiv (All)
open access
Bounds for the ratio between the independent domination number and the domination number
In this article we present new and improved results for the ratio between the independent domination number and the domination number in graphs with bounded degree. We present a general formula, that, for a fixed maximum degree, allows to compute an upper bound for this ratio as a function of an upp
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
- Paired Domination in Cubic Bipartite Graphs#1078223
- Stability of the Strong Domination Number of Graphs#793545
- Stability of the Strong Domination Number of Graphs#789541
- Upper bounds for double Roman domination and $[k]$-Roman domination of cylindrical graphs $C_m \Box P_n$#1076857
- Ramsey achievement games on graphs : algorithms and bounds#796468
Record · ID 1141571
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