PhilArchive
open access
Outer-independent convex Roman domination in graphs
In this paper, we initiate the study of a new restricted parameter of convex Roman domination in graphs, called the outer-independent convex Roman dominating function, and discuss some of its combinatorial properties.
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
- Locating-dominating partitions for some classes of graphs#147107
- A Faster Auction Algorithm for Weighted Matroid Intersection#1155855
- Matching complements in subcubic graphs and a proof of the 3-Decomposition Conjecture#926194
- Kalai's Conjecture for Tight Trees#985413
- Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs#1141333
Record · ID 707578
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