Twin-free isolate-free graphs in four specific classes admit a partition of their vertices into two locating-dominating sets, confirming the γ_LD(G) ≤ n/2 conjecture for those classes.
Chv´ atal, A combinatorial theorem in plane geometry , J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Locating-dominating partitions for some classes of graphs
Twin-free isolate-free graphs in four specific classes admit a partition of their vertices into two locating-dominating sets, confirming the γ_LD(G) ≤ n/2 conjecture for those classes.