Subset Perfect Codes of Finite Commutative Rings Over Induced Subgraphs of Unit Graphs
From MaRDI portal
Publication:6120125
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of commutative algebra (05E40) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Theory of error-correcting codes and error-detecting codes (94B99) General commutative ring theory and combinatorics (zero-divisor graphs, annihilating-ideal graphs, etc.) (13A70)
Recommendations
Cites work
- A Mathematical Theory of Communication
- A survey of perfect codes
- Basic modern algebra with applications
- Characterization of subgroup perfect codes in Cayley graphs
- Classification of rings with unit graphs having domination number less than four
- Coloring of commutative rings
- Efficient dominating sets in Cayley graphs.
- Error detecting and error correcting codes
- Independent perfect domination sets in Cayley graphs
- Necessary and sufficient conditions for unit graphs to be Hamiltonian
- On subgroup perfect codes in Cayley graphs
- On the diameter and girth of a zero-divisor graph
- On the extended zero divisor graph of commutative rings
- On the girth of the unit graph of a ring
- Perfect codes in Cayley graphs
- Perfect codes in Cayley sum graphs
- Perfect codes in graphs
- Perfect codes in proper reduced power graphs of finite groups
- Rings whose unit graphs are planar
- The diameter of unit graphs of rings
- The zero-divisor graph of a commutative ring
- The zero-divisor graph of a non-commutative ring.
- Unit graphs associated with rings
Cited in
(2)
This page was built for publication: Subset Perfect Codes of Finite Commutative Rings Over Induced Subgraphs of Unit Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120125)