Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronic Journal of Graph Theory and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
