@article{Su2024, 
author = {Huadong Su and Zhunti Liang},
title = {The diameter of the nil-clean graph of  Zn},
year = {2024},
journal = {AIMS Mathematics},
volume = {9},
number = {9},
pages = {24854-24859},
keywords = {nil-clean graph, integers modulo n, diameter, Chinese remainder theorem},
url = {https://www.sciopen.com/article/10.3934/math.20241210},
doi = {10.3934/math.20241210},
abstract = {Let  R be a ring with identity. An element  r was called to be nil-clean if  r was a sum of an idempotent and a nilpotent element in  R. The nil-clean graph of  R was a simple graph, denoted by  GNC(R), whose vertex set was  R, where two distinct vertices  x and  y were adjacent if, and only if,  x+y was a nil-clean element of  R. In the absence of the condition that vertex  x is not the same as  y, the graph defined in the same way was called the closed nil-clean graph of  R, which may contain loops, and was denoted by  GNC¯(R). In this short note, we completely determine the diameter of  GNC(Zn).}
}