Foucaud–Henning conjecture on location-domination in twin-free graphs

Let GG be a graph of order nn with no isolated vertices. A graph is twin-free if no two distinct vertices have the same open or closed neighborhood, and let γL(G)\gamma_L(G) be its location-domination number. Foucaud–Henning conjecture. Every twin-free graph GG of order nn without isolated vertices satisfies

γL(G)n2.\gamma_L(G)\le\frac{n}{2}.

This is proposed as a strengthening of the Garijo–González–Márquez conjecture and as an analogue of Ore’s one-half bound for the domination number; its status is open.

Sources & referencesView supporting material

Primary source

Florent Foucaud and Michael A. Henning, “Location-domination and matching in cubic graphs”, arXiv:1412.2865 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.