Locating domination in bipartite graphs and their complements

DOI10.1016/j.dam.2018.09.034zbMath1414.05227arXiv1711.01951OpenAlexW2963825781MaRDI QIDQ2420423

Mercè Mora, Carmen Hernando, Ignacio M. Pelayo

Publication date: 6 June 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

bipartite graphlocationdominationcomplement graphdistinguishing setlocating domination

Mathematics Subject Classification ID

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

Related Items

Global location-domination in the join and Cartesian product of graphs, Unnamed Item, Neighbor-locating colorings in graphs, On locating-dominating set of regular graphs, Improved lower bound for locating-dominating codes in binary Hamming spaces, Locating-dominating sets of functigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Identifying codes and locating-dominating sets on paths and cycles
• On locating--dominating sets in infinite grids
• Locating-dominating codes: bounds and extremal cardinalities
• Locating-dominating sets in twin-free graphs
• Identifying and locating-dominating codes on chains and cycles
• Nordhaus-Gaddum bounds for locating domination
• On global location-domination in graphs