Locating-dominating sets in twin-free graphs

DOI10.1016/j.dam.2015.06.038zbMath1329.05231arXiv1412.2376OpenAlexW2166937745MaRDI QIDQ906432

Christian Löwenstein, Michael A. Henning, Thomas Sasse, Florent Foucaud

Publication date: 21 January 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.2376

zbMATH Keywords

dominating setslocating-dominating sets

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (20)

Revisiting and Improving Upper Bounds for Identifying Codes ⋮ Locating-total dominating sets in twin-free graphs: a conjecture ⋮ Extremal cubic graphs for fault-tolerant locating domination ⋮ On connected 3-\(\gamma_L\)-dot-critical graphs ⋮ Location-domination in line graphs ⋮ Locating domination in bipartite graphs and their complements ⋮ Bounds on the locating Roman domination number in trees ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ On redundant locating-dominating sets ⋮ Locating-dominating sets in local tournaments ⋮ \( [ 1 , 2 \)-dimension of graphs] ⋮ Location-domination and matching in cubic graphs ⋮ Bounds on the locating-domination number and differentiating-total domination number in trees ⋮ Characterizing extremal graphs for open neighbourhood location-domination ⋮ On locating-dominating set of regular graphs ⋮ Domination and location in twin-free digraphs ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ Locating-dominating sets of functigraphs ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Locating-dominating sets: from graphs to oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The difference between the metric dimension and the determining number of a graph
• Locating-total domination in claw-free cubic graphs
• Extremal graphs for the identifying code problem
• Nordhaus-Gaddum bounds for locating domination
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Domination and location in acyclic graphs
• Domination-balanced graphs

This page was built for publication: Locating-dominating sets in twin-free graphs