In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores
Nasehpour, P. (2019). A generalization of zero-divisor graphs. Journal of Algorithms and Computation, 51(2), 35-45. https://doi.org/10.22059/jac.2019.75141
MLA
Nasehpour, P. "A generalization of zero-divisor graphs", Journal of Algorithms and Computation, 51, 2, 2019, 35-45. doi: 10.22059/jac.2019.75141
HARVARD
Nasehpour P. (2019). 'A generalization of zero-divisor graphs', Journal of Algorithms and Computation, 51(2), pp. 35-45. doi: 10.22059/jac.2019.75141
CHICAGO
P. Nasehpour, "A generalization of zero-divisor graphs," Journal of Algorithms and Computation, 51 2 (2019): 35-45, doi: 10.22059/jac.2019.75141
VANCOUVER
Nasehpour P. A generalization of zero-divisor graphs. J. Algo. Comp. 2019;51(2):35-45. doi: 10.22059/jac.2019.75141
