The upper deg-centric graph of a simple, connected graph G, denoted by Gud, is a graph constructed from G such that V (Gud) = V (G) and E(Gud) = {vivj : dG(vi, vj ) ≥ degG(vi)}. This paper introduces and discusses the ...