Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
