The coarse deg-centric graph of a simple, connected graph G, denoted by Gcd, is a graph constructed from G such that V(Gcd) = V(G) and E(Gcd) = {vi vj : dG( vi, vj) > degG(vi)}. This paper introduces and discusses the concepts of coarse deg-centric graphs and iterated coarse deg-centrication of a graph. It also presents the properties and structural characteristics of coarse deg-centric graphs of some graph families.
No takes yet. Share an insight, caveat, or question.
Thalavayalil et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: