Pages that link to "Item:Q628345"

The following pages link to Open neighborhood locating-dominating in trees (Q628345):

Displaying 20 items.

• Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
• Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
• Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
• Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
• Identification of points using disks (Q1618247) (← links)
• Separating codes and traffic monitoring (Q1704860) (← links)
• Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
• Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
• Extremal cubic graphs for fault-tolerant locating domination (Q2143147) (← links)
• Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
• Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← links)
• Optimal open-locating-dominating sets in infinite triangular grids (Q2354721) (← links)
• Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
• Separating Codes and Traffic Monitoring (Q2830061) (← links)
• Open-independent, open-locating-dominating sets (Q5006616) (← links)
• Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs (Q5864729) (← links)
• (Q5889911) (← links)
• Progress on fault-tolerant locating-dominating sets (Q6174163) (← links)
• On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)
• Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)