Upper Bounds for Double Roman Domination and [<i>k</i>]-Roman Domination of Cylindrical Graphs <i>C</i><sub>m</sub>☐<i>P</i><sub>n</sub>
Roman-type domination parameters form an important class of graph invariants that model protection and resource allocation problems on networks. Among them, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>[</mo><mi>k</mi><mo>]</mo></mrow></seman...
Wedi'i Gadw mewn:
| Prif Awduron: | , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
MDPI AG
2026-05-01
|
| Cyfres: | Axioms |
| Pynciau: | |
| Mynediad Ar-lein: | https://www.mdpi.com/2075-1680/15/5/382 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|