Every tree and every twin-free unicyclic graph admits an independent locating-dominating set, while certain girth-4 graphs of order at least 9 do not.
Locating-domination and identification
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Independent Locating-Dominating Sets in Pseudotrees
Every tree and every twin-free unicyclic graph admits an independent locating-dominating set, while certain girth-4 graphs of order at least 9 do not.