Subset Perfect Codes of Finite Commutative Rings Over Induced Subgraphs of Unit Graphs
DOI10.47836/mjms.16.4.10OpenAlexW4312200224MaRDI QIDQ6120125
Unnamed Author, Unnamed Author, Nor Haniza Sarmin
Publication date: 25 March 2024
Published in: Malaysian Journal of Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.47836/mjms.16.4.10
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Theory of error-correcting codes and error-detecting codes (94B99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of commutative algebra (05E40) General commutative ring theory and combinatorics (zero-divisor graphs, annihilating-ideal graphs, etc.) (13A70)
Related Items (1)
Cites Work
- Unnamed Item
- A Mathematical Theory of Communication
- Necessary and sufficient conditions for unit graphs to be Hamiltonian
- On the diameter and girth of a zero-divisor graph
- Coloring of commutative rings
- The zero-divisor graph of a commutative ring
- Efficient dominating sets in Cayley graphs.
- The diameter of unit graphs of rings
- Perfect codes in Cayley sum graphs
- On subgroup perfect codes in Cayley graphs
- Characterization of subgroup perfect codes in Cayley graphs
- Classification of rings with unit graphs having domination number less than four
- Perfect codes in graphs
- Independent perfect domination sets in Cayley graphs
- Rings whose unit graphs are planar
- Basic Modern Algebra with Applications
- Unit Graphs Associated with Rings
- Perfect Codes in Cayley Graphs
- Error Detecting and Error Correcting Codes
- On the extended zero divisor graph of commutative rings
- Perfect codes in proper reduced power graphs of finite groups
- ON THE GIRTH OF THE UNIT GRAPH OF A RING
- A survey of perfect codes
This page was built for publication: Subset Perfect Codes of Finite Commutative Rings Over Induced Subgraphs of Unit Graphs
