Pages that link to "Item:Q967383"
From MaRDI portal
The following pages link to Locating and paired-dominating sets in graphs (Q967383):
Displaying 12 items.
- Locating-total domination in graphs (Q442212) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- Resolving dominating partitions in graphs (Q2026342) (← links)
- On locating-dominating set of regular graphs (Q2052122) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- Locating-total domination number of cacti graphs (Q2209668) (← links)
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
- Locating-dominating sets of functigraphs (Q2333813) (← links)
- Locating-paired-dominating sets in square grids (Q2346332) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)