Nordhaus-Gaddum bounds for locating domination
From MaRDI portal
Publication:2441609
DOI10.1016/j.ejc.2013.04.009zbMath1284.05197arXiv1207.2142OpenAlexW2056981618MaRDI QIDQ2441609
Mercè Mora, Ignacio M. Pelayo, Carmen Hernando
Publication date: 25 March 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.2142
Related Items (19)
LD-graphs and global location-domination in bipartite graphs ⋮ The difference between the metric dimension and the determining number of a graph ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Locating domination in bipartite graphs and their complements ⋮ On redundant locating-dominating sets ⋮ \( [ 1 , 2 \)-dimension of graphs] ⋮ Locating-dominating codes: bounds and extremal cardinalities ⋮ On the binary locating-domination number of regular and strongly-regular graphs ⋮ Locating-dominating sets in twin-free graphs ⋮ Global location-domination in the join and Cartesian product of graphs ⋮ Resolving dominating partitions in graphs ⋮ Neighbor-locating colorings in graphs ⋮ Neighbor-locating coloring: graph operations and extremal cardinalities ⋮ Locating-Domination and Identification ⋮ GLOBAL LOCATION-DOMINATION IN THE LEXICOGRAPHIC PRODUCT AND CORONA OF GRAPHS ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs ⋮ Open-independent, open-locating-dominating sets
Cites Work
- Nordhaus-Gaddum for treewidth
- Locating-dominating codes: bounds and extremal cardinalities
- Complement reducible graphs
- Resolvability in graphs and the metric dimension of a graph
- A survey of Nordhaus-Gaddum type relations
- Extremal graph theory for metric dimension and diameter
- Nordhaus-Gaddum bounds for total domination
- Towards a theory of domination in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Nordhaus-Gaddum bounds for locating domination