PhilArchive
open access
Fair hop Roman dominating function in graphs
This paper introduces a new variant of a hop Roman dominating function in graphs called the fair hop Roman dominating function. Moreover, several important combinatorial properties and characterizations of fair hop Roman dominating functions in various graph classes were investigated.
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
- The Dual-Server Domination Number of Some Graph Operations#609123
- Making spanning graphs#1122858
- Size Ramsey Numbers Involving Double Stars and Brooms#492255
- Subgraph Games in the Semi-Random Graph Process and Its Generalization to Hypergraphs#628834
- Tight degeneracy bounds in online Ramsey games#1156788
Record · ID 76372
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