Pages that link to "Item:Q344871"
From MaRDI portal
The following pages link to Algorithmic aspects of open neighborhood location-domination in graphs (Q344871):
Displaying 9 items.
- Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
- Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs (Q2091788) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- OLD trees with maximum degree three (Q2878227) (← links)
- (Q3565861) (← links)
- The adjacency dimension of graphs (Q5089704) (← links)
- On open neighborhood locating-dominating in graphs (Q5177037) (← links)
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs (Q5864729) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)