Pages that link to "Item:Q2441609"

The following pages link to Nordhaus-Gaddum bounds for locating domination (Q2441609):

Displaying 19 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)
• Resolving dominating partitions in graphs (Q2026342) (← links)
• Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs (Q2091788) (← 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)
• Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
• On redundant locating-dominating sets (Q2686136) (← links)
• Global location-domination in the join and Cartesian product of graphs (Q2695471) (← links)
• Locating-Domination and Identification (Q3384611) (← links)
• GLOBAL LOCATION-DOMINATION IN THE LEXICOGRAPHIC PRODUCT AND CORONA OF GRAPHS (Q4973435) (← links)
• Open-independent, open-locating-dominating sets (Q5006616) (← links)
• \( [ 1 , 2 ]\)-dimension of graphs (Q6162042) (← links)
• On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)