Open locating-dominating sets in circulant graphs
type: Item
instance of: scholarly article
title: Open locating-dominating sets in circulant graphs
zbMATH Open document ID: 1479.05265
author: Robin M. Givens
author: Gexin Yu
author: Rex K. Kincaid
publication date: 2022-01-03T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7451239
zbMATH Keywords: open locating-dominating sets
zbMATH Keywords: circulant graphs
zbMATH Keywords: Hall's matching theorem
zbMATH Keywords: mixed-weight open locating-dominating sets
MaRDI profile type: Publication
full work available at URL: dmgt.2235
OpenAlex ID: W2963624766
cites work: Every planar map is four colorable. I: Discharging
cites work: Discrete sensor placement problems in distribution networks
cites work: Identifying and locating-dominating codes on chains and cycles
cites work: A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
cites work: New bounds on the minimum density of an identifying code for the infinite hexagonal grid
cites work: Location-domination and matching in cubic graphs
cites work: Q4667607
cites work: On the size of identifying codes in binary hypercubes
cites work: Optimal open-locating-dominating sets in infinite triangular grids
cites work: Identifying Codes and Covering Problems
cites work: Locating and liar domination of circulant networks.
cites work: Q3565861
cites work: Open neighborhood locating-domination for grid-like graphs
Wikidata QID: Q127452942
DOI: 10.7151/DMGT.2235
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 7451239