Identifying codes in the direct product of a complete graph and some special graphs
type: Item
instance of: scholarly article
title: Identifying codes in the direct product of a complete graph and some special graphs
zbMATH Open document ID: 1404.05182
author: Xianqiang Yang
published in: Discrete Applied Mathematics
publication date: 2019-02-08T00:00:00Z
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 94B99
zbMATH DE Number: 7018425
zbMATH Keywords: identifying code
zbMATH Keywords: direct product
zbMATH Keywords: complete graph
zbMATH Keywords: cycle
zbMATH Keywords: bipartite graph
MaRDI profile type: Publication
full work available at URL: j.dam.2018.06.027
OpenAlex ID: W2887945455
cites work: Exact Minimum Density of Codes Identifying Vertices in the Square Grid
cites work: Identifying and locating-dominating codes on chains and cycles
cites work: Q4659582
cites work: Identifying codes and locating-dominating sets on paths and cycles
cites work: Identifying codes of corona product graphs
cites work: Identifying codes of lexicographic product of graphs
cites work: On the size of identifying codes in triangle-free graphs
cites work: Identifying codes of cycles
cites work: Identifying codes of Cartesian product of two cliques of the same size
cites work: On identifying codes in the Cartesian product of a path and a complete graph
cites work: On identifying codes in binary Hamming spaces
cites work: On the size of identifying codes in binary hypercubes
cites work: Optimal identifying codes in cycles and paths
cites work: On a new class of codes for identifying vertices in graphs
cites work: Q5393489
cites work: Q3517160
cites work: Identifying codes of the direct product of two cliques
cites work: Identifying codes of cycles with odd orders
DOI: 10.1016/J.DAM.2018.06.027
description: scientific article; zbMATH DE number 7018425