Pith. sign in

REVIEW

Identifying codes of lexicographic product of graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1106.3607 v1 pith:MSEWTUHT submitted 2011-06-18 math.CO

Min Feng , Min Xu , Kaishun Wang This is my paper
classification math.CO
keywords codesidentifyingproductgraphgraphslexicographicarbitrarycardinality
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Pith tools