LD-graphs and global location-domination in bipartite graphs

DOI10.1016/j.endm.2014.08.030zbMath1338.05201OpenAlexW2073810209MaRDI QIDQ283710

Carmen Hernando, Ignacio M. Pelayo, Mercè Mora

Publication date: 13 May 2016

Full work available at URL: http://hdl.handle.net/2117/24830

zbMATH Keywords

bipartite graphlocationdominationcomplement graph

Mathematics Subject Classification ID

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

Related Items (3)

On the binary locating-domination number of regular and strongly-regular graphs ⋮ The binary locating-dominating number of some convex polytopes ⋮ Binary locating-dominating sets in rotationally-symmetric convex polytopes

Cites Work

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

This page was built for publication: LD-graphs and global location-domination in bipartite graphs