Pages that link to "Item:Q2441609"
From MaRDI portal
The following pages link to Nordhaus-Gaddum bounds for locating domination (Q2441609):
Displayed 10 items.
- LD-graphs and global location-domination in bipartite graphs (Q283710) (← links)
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- Neighbor-locating coloring: graph operations and extremal cardinalities (Q1792080) (← links)
- Neighbor-locating colorings in graphs (Q2285128) (← links)
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
- Locating domination in bipartite graphs and their complements (Q2420423) (← links)
- GLOBAL LOCATION-DOMINATION IN THE LEXICOGRAPHIC PRODUCT AND CORONA OF GRAPHS (Q4973435) (← links)