Zero-divisor super- graphs
From MaRDI portal
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.
Recommendations
Cites work
- Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
- Codes from incidence matrices of graphs
- Handbook of Graph Theory
- scientific article; zbMATH DE number 4208109 (Why is no real title available?)
- scientific article; zbMATH DE number 3497930 (Why is no real title available?)
- Idealization of a module
- Introduction to Coding Theory
- On super-edge-connected digraphs and bipartite digraphs
- On the diameter and girth of a zero-divisor graph
- On the extended zero divisor graph of commutative rings
- On the Zero-Divisor Graph of a Ring
- The diameter of a zero divisor graph
- The zero-divisor graph of a commutative ring
- Zero-divisor graphs in commutative rings
- Zero-divisor graphs, von Neumann regular rings, and Boolean algebras.
This page was built for publication: Zero-divisor super-\(\lambda\) graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6188413)