Abstract
The total (vertex/edge) chromatic number of a graph G, χ ″ ( G ) ( χ ( G ) / χ ′ ( G ) ) is defined to be the minimum number of colours needed to colour the vertices and edges, together termed as elements (vertices/edges) of a graph in such a way that no two adjacent/incident elements (vertices/edges) are given the same colour. In this article, we determine the vertex, edge and total chromatic number of some hypercube variants such as folded hypercube, enhanced hypercube, augmented hypercube and exchanged hypercube.
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: International Journal of Computer Mathematics: Computer Systems Theory
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.
