On k-Roman graphs

Key Points

• K-roman graphs exhibit unique properties related to vertex domination, crucial for optimizing graph structures.
• A significant finding includes the identification of minimal dominating sets across various scenarios in these graphs.
• Using advanced graph theoretical methods, the study investigates critical subgraphs and their implications for network analysis.
• These findings may enable innovative applications in data structure optimization and algorithm development.