Roman domination in upper deg-centric graphs

Roman domination in upper deg-centric graphs

Timmy Tomy Thalavayalil – GJM, Volume 10, Issue 2 (2025), 46-54.

The upper deg-centric graph of a simple, connected graph G , denoted by G_{ud} , is a graph constructed from $G$ such that V(G_{ud}) = V(G) and E(G_{ud}) = \{v_iv_j: d_G(v_i,v_j) \geq \deg_G(v_i)\} . We investigate the properties and structural characteristics of these graphs, and compute their Roman domination number for a variety of examples.

Categories: Issue2

Milestones:

Received: February 26, 2025
Accepted: October 15, 2025
Published: December 10, 2025

Authors:

Timmy Tomy Thalavayalil
Department of Mathematics
Kristu Jayanti University, Bengaluru-560077, INDIA

Download:

Print Version