arXiv (All)
open access
Further results on \([k]\)-Roman domination on cylindrical grids \(C_m \Box P_n\)
In this paper, we study the $[k]$-Roman domination number of cylindrical graphs $C_m \Box P_n$. Our analysis begins with a general lower bound based on local neighborhood constraints. We show that $γ_{[kR]}(C_m\Box P_n) > \frac{(k+1)mn}{5}.$ By exploiting the connection between $[k]$-Roman dominatio
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
- Upper bounds for double Roman domination and $[k]$-Roman domination of cylindrical graphs $C_m \Box P_n$#1076857
- Vertices that belong to every minimum dominating set of a graph and their connection with transportation sharing systems with study cases in Campo de Gibraltar area#1115774
- Stability of the Strong Domination Number of Graphs#793545
- Stability of the Strong Domination Number of Graphs#789541
- A $2/3$ Bound for Vizing's Conjecture#997511
Record · ID 1076842
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