arXiv (All)
open access
Upper bounds for double Roman domination and $[k]$-Roman domination of cylindrical graphs $C_m \Box P_n$
Roman-type domination parameters form an important class of graph invariants that model protection and resource allocation problems on networks. Among them, $[k]$-Roman domination provides a unified framework that generalizes Roman, double Roman, and higher-order variants. In this paper we investiga
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
- Further results on \([k]\)-Roman domination on cylindrical grids \(C_m \Box P_n\)#1076842
- Stability of the Strong Domination Number of Graphs#793545
- Stability of the Strong Domination Number of Graphs#789541
- Paired Domination in Cubic Bipartite Graphs#1078223
- Bounds for the ratio between the independent domination number and the domination number#1141571
Record · ID 1076857
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