Perfect codes in some products of graphs
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...
Kaydedildi:
Asıl Yazarlar: | , , |
---|---|
Materyal Türü: | EJournal Article |
Baskı/Yayın Bilgisi: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-04-15.
|
Konular: | |
Online Erişim: | Get Fulltext |
Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Internet
Get Fulltext3rd Floor Main Library
Yer Numarası: |
A1234.567 |
---|---|
Kopya Bilgisi 1 | Kütüphanede |