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...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsmän: Bakaein, Samane; Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad (Författare, medförfattare), Tavakoli, Mostafa; Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad (Författare, medförfattare), Rahbarnia, Freydoon; Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad (Författare, medförfattare)
Materialtyp: EJournal Article
Publicerad: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2021-04-15.
Ämnen:
Länkar:Get Fulltext
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Internet

Get Fulltext

3rd Floor Main Library

Beståndsuppgifter i 3rd Floor Main Library
Signum: A1234.567
Exemplar 1 Tillgänglig