arXiv (All)
open access
The Minimum-Weight Mixed Dominating Set on Threshold Graphs
We study the minimum-weight mixed dominating set problem on threshold graphs. In this problem, vertices and edges have weights, and the goal is to find a mixed set of minimum total weight that dominates every vertex and edge of the graph. We first show that arbitrary weights can be reduced to non-ne
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 Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- Outer-connected fair Roman dominating function in graphs#119659
- Chromatic Extremal Thresholds and the Multipartite $K_4$-Free Problem#1064047
- Vertex Cover Interdiction in Bipartite Graphs#1051033
Record · ID 924639
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