arXiv (All)
open access
Perfect Italian Domination on and Near Split Graphs: Algorithms, Hardness, and Approximation
A perfect Italian dominating function assigns a label from $\{0,1,2\}$ to each vertex so that the labels in the neighborhood of every zero-labeled vertex sum to exactly two. Although the associated decision problem (PID) is NP-complete on chordal graphs, the complexity status on split graphs remains
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
- An improved upper bound for the fair domination number of maximal outerplanar graphs#1048825
- Another Brick in the Wall: A Computationally Assisted Proof of an Improved Upper Bound for Thrackles#1342723
- Graph Theory: Fundamental and Applications in Mathematics#119203
- Approximation and Hardness Results for the Parallel-Block Construction Problem / Arivarasan Karmegam, Alexandru Popa, Lucianna Kiffer, Antonio Fernández Anta#1188461
- Algorithmic Lower Bounds: Fun with Hardness Proofs#3416
Record · ID 1234335
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