Locating and paired-dominating sets in graphs
From MaRDI portal
Publication:967383
DOI10.1016/j.dam.2009.06.019zbMath1213.05196MaRDI QIDQ967383
Michael A. Henning, John J. McCoy
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.06.019
differentiating-paired-dominating set; locating-paired-dominating set; metric-locating-paired-dominating set
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
An optimal algorithm to find minimum k-hop dominating set of interval graphs, An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs, Locating-total domination in graphs, Resolving dominating partitions in graphs, Locating-total domination number of cacti graphs, Metric-locating-dominating sets of graphs for constructing related subsets of vertices, Locating-paired-dominating sets in square grids, A linear-time algorithm for paired-domination on circular-arc graphs
Cites Work
- Which trees have a differentiating-paired dominating set?
- Graphs with large paired-domination number
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Resolvability in graphs and the metric dimension of a graph
- Paired-domination of trees
- Locating and total dominating sets in trees
- On locating and differetiating-total domination in trees
- Domination and location in acyclic graphs
- Paired-domination
- Paired-domination in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item