Abstract
Let \(G = (V(G),E(G))\) be a simple graph and an achromatic coloring of \(G\) is a proper vertex coloring of \(G\) in which every pair of colors appears on at least one pair of adjacent vertices. The achromatic number of \(G\) denoted by \(\psi(G)\), is the greatest number of colors in an achromatic coloring of \(G\). In this paper, we find out the achromatic number for Corona graph of Cycle with Path graphs on the same order \(n\), Path with Cycle graphs on the same order \(n\), Path with Complete graphs on the same order \(n\), Path of order \(n\) with Star graph on order \(n+1\), Path with Wheel graphs on the same order \(n\) and Ladder graph with Path graph on the same order \(n\).
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 callDisclaimer: 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.
