Work

A note on locating-dominating sets in twin-free graphs

Year: 2024

Type: article

Abstract: In this short note, we prove that every twin-free graph on n vertices contains a locating-dominating set of size at most . This improves the earlier bound of due to Foucaud, Henning, Löwenstein and Sasse from 2016, and makes some progress towards the well-studied locating-dominating conjecture of Garijo, González and Márquez.

Source: Discrete Mathematics

DOI: 10.1016/j.disc.2024.114297

Authors: Nicolas Bousquet, Quentin Chuet, Victor Falgas–Ravry, Amaury Jacques, Laure Morelle

Institutions: Lyon 1 Université, Centre National de la Recherche Scientifique, Laboratoire d'Informatique en Images et Systèmes d'Information, Université Paris-Saclay, Laboratoire Interdisciplinaire des Sciences du Numérique, Umeå University, Université de Bordeaux, Laboratoire Bordelais de Recherche en Informatique, Université de Montpellier, Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,120

Funders: Deutsche Forschungsgemeinschaft, Agence Nationale de la Recherche, Vetenskapsrådet

Awards: Graph Reconfiguration, Unifying Theories for Multivariate Algorithms, Exploring the Limits of Tractability, Extremal problems for multicoloured graphs and locally dependent percolation, G4656594441

OpenAlex ID: W4403933680

FWCI: 0.195

Cites: 7

Cited by: 1

Related to: 10