Abstract
The concept of [Formula: see text]-dynamic [Formula: see text]-coloring of a graph [Formula: see text] refers to a proper vertex [Formula: see text]-coloring where the number of colors assigned to the vertices in the neighborhood of each vertex [Formula: see text] is greater than or equal to the min [Formula: see text]. This study focuses on the [Formula: see text]-dynamic coloring of various types of ladder graphs, which are derived from the Cartesian product of [Formula: see text] and [Formula: see text], including the Diagonal Ladder Graph, Open Diagonal Ladder Graph, Triangular Ladder Graph, Open Triangular Ladder Graph and Slanting Ladder Graph.
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.
