This research examines roman domination numbers in lower deg-centric graphs, highlighting their unique properties.
The lower deg-centric graph of a simple, connected graph \(G\), denoted by \(Gld\), is a graph constructed from \(G\) such that \(V(Gld) = V(G)\) and \(E(Gld) = \{v_iv_j: d_G(v_i,v_j) < _G(v_i)\}\). This paper presents the Roman domination number of lower deg-centric graphs. Also, investigate the properties and structural characteristics of this type of graph.
No takes yet. Share an insight, caveat, or question.
Timmy Tomy Thalavayalil (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: