10.9k citations
- Centre National de la Recherche ScientifiqueFR128 papers
- Université Clermont AuvergneFR88 papers
- Institut PascalFR65 papers
- Aix-Marseille UniversitéFR57 papers
- Czech Technical University in PragueCZ54 papers
- Lyon 1 UniversitéFR54 papers
- University of ManchesterGB54 papers
- Brookhaven National LaboratoryUS53 papers
- Charles UniversityCZ53 papers
- Czech Academy of SciencesCZ53 papers
- Johannes Gutenberg University MainzDE53 papers
- Joint Institute for Nuclear ResearchRU53 papers
Showing 2014 · math.COShow all
3 papers · 2 filters
math.CO2014★ 16 cited
Location-domination and matching in cubic graphs
Florent Foucaud, Michael A. Henning
A dominating set of a graph is a set of vertices of such that every vertex outside is adjacent to a vertex in . A locating-dominating set of is a dominating…
math.CO2014★ 42 cited
Locating-dominating sets in twin-free graphs
Florent Foucaud, Michael A. Henning, Christian Löwenstein +1
A locating-dominating set of a graph is a dominating set of with the additional property that every two distinct vertices outside have distinct neighbors in ; th…
math.CO2014
Locating-dominating sets and identifying codes in graphs of girth at least 5
Camino Balbuena, Florent Foucaud, Adriana Hansberg
Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such…