Abstract
An adjacent vertex distinguishing incidence coloring of graph of G is an incidence coloring of G such that no pair of adjacent vertices meets the same set of colors. We obtain the adjacent vertex distinguishing incidence chromatic number of the Cartesian product of triangular lattice and infinite path, and hexagonal lattice and infinite path.
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 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.
