arXiv (All)
open access
Paired Disjunctive Domination Number of Middle Graphs
The concept of domination in graphs plays a central role in understanding structural properties and applications in network theory. In this study, we focus on the paired disjunctive domination number in the context of middle graphs, a transformation that captures both adjacency and incidence relatio
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
- A Note on Triple Repetition Sequence of Domination Number in Graphs#722491
- An improved lower and upper bound of the k-limited domination number#1156714
- Constructions for positional games and applications to domination games / Ali Deniz Bagdas, Dennis Clemens, Fabian Hamann, Yannick Mogge#921993
- Colorful Minors#927142
- On Hypergraph Supports#1013362
Record · ID 1012030
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