The deg-centric graph of a simple, connected graph G, denoted by Gd, is a graph constructed from G such that, V(Gd) = V(G) and E(Gd) = {vivj: dG(vi,vj) ≤ degG(vi)}. In this paper, the concepts of deg-centric graphs and iterated deg-centrication of a graph are introduced and discussed.
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:
More from Proyecciones (Antofagasta)