A generalization of zero-divisor graphs

A generalization of zero-divisor graphs

Journal of Algorithms and Computation, Vol. 51, No. 2, pp. 35--45 (2019) 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.

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Nasehpour, Peyman
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Discrete Mathematics
Mathematics - Rings and Algebras
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Journal of Algorithms and Computation, Vol. 51, No. 2, pp. 35--45 (2019) 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.
DOI:10.48550/arxiv.1911.06244