Open locating-dominating sets in circulant graphs

DOI10.7151/dmgt.2235zbMath1479.05265OpenAlexW2963624766WikidataQ127452942 ScholiaQ127452942MaRDI QIDQ2062672

Robin M. Givens, Gexin Yu, Rex K. Kincaid

Publication date: 3 January 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2235

zbMATH Keywords

circulant graphsHall's matching theoremmixed-weight open locating-dominating setsopen locating-dominating sets

Mathematics Subject Classification ID

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

Related Items (3)

Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ Characterizing extremal graphs for open neighbourhood location-domination ⋮ Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs

Cites Work

• Location-domination and matching in cubic graphs
• On the size of identifying codes in binary hypercubes
• Every planar map is four colorable. I: Discharging
• Identifying and locating-dominating codes on chains and cycles
• Optimal open-locating-dominating sets in infinite triangular grids
• A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
• New bounds on the minimum density of an identifying code for the infinite hexagonal grid
• Discrete sensor placement problems in distribution networks
• Identifying Codes and Covering Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Open locating-dominating sets in circulant graphs