Abstract
A vertex coloring of a graph is called an exact square coloring of G if any pair of vertices at distance 2 receive distinct colors. The minimum number of colors required by any exact square coloring is called the exact square chromatic number of G and is denoted by A set of vertices is called an exact square clique of G if any pair of vertices of the set are at distance 2. The exact square clique number of G, denoted by is the maximum cardinality of an exact square clique of G and clearly, In this article, we give tight upper bounds of the exact square chromatic number of various standard graph operations, including the Cartesian product, strong product, lexicographic product, corona product, edge corona product, join, subdivision, and Mycielskian of a graph. We also present tight lower bounds of the exact square clique number of these graph operations.
Sign-in/Register to access full text options 
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: AKCE International Journal of Graphs and Combinatorics
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.
