Identifying codes of lexicographic product of graphs

Details Identifying codes of lexicographic product of graphs Identifying codes of lexicographic product of graphs

2011-06-18

arxiv.org/abs/1106.3607v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Identifying codes of lexicographic product of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Identifying codes of lexicographic product of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Identifying codes of lexicographic product of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465372