A study on coarse deg-centric graphs

Main Article Content

Timmy Tomy Thalavayalil
Sudev Naduvath

Abstract

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.

Downloads

Download data is not yet available.

Article Details

How to Cite
Thalavayalil, T. T., & Naduvath, S. (2024). A study on coarse deg-centric graphs. Gulf Journal of Mathematics, 16(2), 171-182. https://doi.org/10.56947/gjom.v16i2.1877
Section
Articles