Nordhaus-Gaddum bounds for locating domination

From MaRDI portal
Publication:2441609


DOI10.1016/j.ejc.2013.04.009zbMath1284.05197arXiv1207.2142MaRDI QIDQ2441609

Mercè Mora, Ignacio M. Pelayo, Carmen Hernando

Publication date: 25 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.2142

zbMATH Keywords

metric-locating-dominating set


Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)


Related Items

GLOBAL LOCATION-DOMINATION IN THE LEXICOGRAPHIC PRODUCT AND CORONA OF GRAPHS, Open-independent, open-locating-dominating sets, \( [ 1 , 2 \)-dimension of graphs], On the binary locating-domination number of regular and strongly-regular graphs, LD-graphs and global location-domination in bipartite graphs, The difference between the metric dimension and the determining number of a graph, Fault tolerant detectors for distinguishing sets in graphs, Locating-dominating codes: bounds and extremal cardinalities, Locating-dominating sets in twin-free graphs, Neighbor-locating coloring: graph operations and extremal cardinalities, Resolving dominating partitions in graphs, Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs, Neighbor-locating colorings in graphs, Metric-locating-dominating sets of graphs for constructing related subsets of vertices, Locating domination in bipartite graphs and their complements, Fault-tolerant detectors for distinguishing sets in cubic graphs, On redundant locating-dominating sets, Global location-domination in the join and Cartesian product of graphs, Locating-Domination and Identification



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2441609&oldid=15113805"
Powered by MediaWiki