PhilArchive
open access
Outer-connected fair Roman dominating function in graphs
In this paper, we introduce and investigate a new variant of a Roman dominating function in graphs called outer-connected fair Roman dominating function. In addition, we presented some theoretical properties of outer-connected fair Roman dominating functions in some classes of connected graphs and discussed some important results.
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
- Outer-clique Roman dominating function in graphs#72023
- The Minimum-Weight Mixed Dominating Set on Threshold Graphs#924639
- Awesome graph parameters#1063805
- Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity#271808
- Bipartite Turán Numbers of Trees and Star Forests#1118674
Record · ID 119659
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