Semantic Scholar
Open Access
2011
23 sitasi
Identifying Codes of Lexicographic Product of Graphs
Min Feng
Min Xu
Kaishun Wang
Abstrak
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.
Topik & Kata Kunci
Penulis (3)
M
Min Feng
M
Min Xu
K
Kaishun Wang
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2011
- Bahasa
- en
- Total Sitasi
- 23×
- Sumber Database
- Semantic Scholar
- DOI
- 10.37236/2974
- Akses
- Open Access ✓