Zero-divisor super-\(\lambda\) graphs (Q6188413): Difference between revisions

A maximally edge-connected graph with all minimum edge-cuts trivial is called super-\(\lambda\). In this paper, using the finite direct product of finite fields, the ring of the residues, and the trivial extension of rings by a module, the authors show that there are various classes of rings whose zero-divisor graphs are super-\(\lambda\) and then apply these results to determine parameters of some linear codes associated to zero-divisor graphs.