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...
Salvato in:
Autori principali: | , , |
---|---|
Natura: | EJournal Article |
Pubblicazione: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-04-15.
|
Soggetti: | |
Accesso online: | Get Fulltext |
Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|
Accesso online
Get Fulltext3rd Floor Main Library
Collocazione: |
A1234.567 |
---|---|
Copia 1 | Disponibile |