<![CDATA[A digrundy coloring of a graph is a vertex coloring in which every vertex assigned a higher color is adjacent to vertices assigned all smaller colors. The maximum number of colors that can be realized in such a coloring of an acyclic directed graph is called the digrundy number. This paper determines the digrundy numbers of several classes of acyclic directed graphs, namely directed star graphs, directed banana tree graphs, directed fireworks graphs, and directed coconut tree graphs. The analysis is based on structural properties of the graphs and combinatorial arguments derived from digrundy coloring constraints. The results show that the digrundy number of directed star graphs is under orientations where the central vertex satisfies and . For directed banana tree graphs with a specified orientation , the digrundy number is for and for . Under arbitrary orientations, directed fireworks graphs have digrundy number , while for directed coconut tree graphs , the digrundy number is bounded by These findings provide exact values of the digrundy number for the graph classes considered and highlight the role of structural constraints in governing digrundy coloring behavior.]]>
Copyrights © 2026
