Identifying codes of lexicographic product of graphs
Min Feng, Min Xu, Kaishun Wang
TL;DR
This paper studies the minimum size of identifying codes in the lexicographic product of graphs, extending previous work on Cartesian products by providing bounds based on graph parameters.
Contribution
It introduces bounds for the minimum identifying codes of G[H], a lexicographic product, based on parameters of the component graphs G and H.
Findings
Derived bounds for identifying codes in G[H]
Extended understanding from Cartesian to lexicographic products
Applicable to connected and arbitrary graphs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Coding theory and cryptography