This paper uncovers the coloring properties and domination number in deg-centric Jaco graphs, indicating their structural complexities.
The deg-centric graph of a graph , denoted by , is a derived graph with the vertex set same as that of , and . Let and , where . By normal consecutive stepcount for , do as follows: To obtain add the edges with as the maximum such that . After completion of step-count , label the graph . This paper presents the coloring properties, hub number, and domination number of the deg-centric graph of the family of Jaco graphs.
No takes yet. Share an insight, caveat, or question.
Thalavayalil et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: