scientific article; zbMATH DE number 7583271
From MaRDI portal
Publication:5104007
DOI10.22108/toc.2021.122946.1727MaRDI QIDQ5104007
Publication date: 9 September 2022
Full work available at URL: https://arxiv.org/abs/1802.00723
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) General commutative ring theory (13A99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total perfect codes in Cayley graphs
- Efficient domination in cubic vertex-transitive graphs
- On zero-divisor graphs of small finite commutative rings
- Perfect codes over graphs
- Coloring of commutative rings
- Two infinite classes of perfect codes in metrically regular graphs
- Polarities of generalized hexagons and perfect codes
- q-coverings, codes and line graphs
- A constructive characterization of trees with at least k disjoint maximum matchings
- The zero-divisor graph of a commutative ring
- Efficient dominating sets in Cayley graphs.
- Error-correcting codes on the Towers of Hanoi graphs
- Zero-divisor graphs, von Neumann regular rings, and Boolean algebras.
- Weighted independent perfect domination on cocomparability graphs
- Construction of trees and graphs with equal domination parameters
- Lattice-like total perfect codes
- Perfect codes in graphs
- Independent perfect domination sets in Cayley graphs
- On locating numbers and codes of zero divisor graphs associated with commutative rings
- ON GRAPHS ASSOCIATED WITH MODULES OVER COMMUTATIVE RINGS
- On the metric dimension of a zero-divisor graph
- Cut Vertices and Degree One Vertices of Zero-Divisor Graphs
- An Ideal-Based Zero-Divisor Graph of a Commutative Ring
- A characterization of Roman trees
- Characterizations of trees with equal domination parameters
- Error Detecting and Error Correcting Codes
- 1-perfect codes in Sierpiński graphs
- A survey of perfect codes
This page was built for publication:
