arXiv (All)
open access
The $n/2$-bound for locating-dominating sets in subcubic graphs
The location-domination number is conjectured to be at most half of the order for twin-free graphs with no isolated vertices. We prove that this conjecture holds and is tight for subcubic graphs. We also show that the same upper bound holds for subcubic graphs with open twins of degree 3 and closed
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
- Fort Abundance in Zero Forcing#999442
- Reinforcement Learning for Graph Generation under a Hard Assortativity Constraint#1014716
- A Benchmark Dataset for Graph Regression with Homogeneous and Multi-Relational Variants#189278
- 16 U.S.C. § 410rr-5 — Study of possible inclusion of additional sites and ruins#572042
- Data and Code for: Northward Expansion of High-Stature Vegetation Reveals Net Surface-Cooling Feedbacks in the Majority of Canadian Boreal-Tundra Ecozones#633661
Record · ID 1143566
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