Perfect codes in some products of graphs
| Main Authors: | Bakaein, Samane; Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad, Tavakoli, Mostafa; Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad, Rahbarnia, Freydoon; Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2021
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/685 https://www.ejgta.org/index.php/ejgta/article/view/685/pdf_170 |
Daftar Isi:
- A r-perfect code in a graph G = (V(G),E(G)) is a subset C of V(G) for which the balls of radius r centered at the vertices of C form a partition of V(G). In this paper, we study the existence of perfect codes in corona product and generalized hierarchical product of graphs where the cardinality of U is equal to one or two. Also, we give some examples as applications of our results.