Identifying codes of lexicographic product of graphs
Combinatorics
2013-12-20 v1
Abstract
Gravier et al. investigated the identifying codes of Cartesian product of two graphs. In this paper we consider the identifying codes of lexicographic product G[H] of a connected graph G and an arbitrary graph H, and obtain the minimum cardinality of identifying codes of G[H] in terms of some parameters of G and H.
Keywords
Cite
@article{arxiv.1106.3607,
title = {Identifying codes of lexicographic product of graphs},
author = {Min Feng and Min Xu and Kaishun Wang},
journal= {arXiv preprint arXiv:1106.3607},
year = {2013}
}