A study on roman domination lower deg-centric graphs

<p>The lower deg-centric graph of a simple, connected graph <span class="math inline">\(G\)</span>, denoted by <span class="math inline">\(G_{ld}\)</span>, is a graph constructed from <span class="math inline">\(G\)</span> such that <span class="math inline">\(V(G_{ld}) = V(G)\)</span> and <span class="math inline">\(E(G_{ld}) = \{v_iv_j: d_G(v_i,v_j) < \deg_G(v_i)\}\)</span>. This paper presents the Roman domination number of lower deg-centric graphs. Also, investigate the properties and structural characteristics of this type of graph.</p>