Commutative rings introduce a class of identifiable graphs
From MaRDI portal
Recommendations
Cites work
- Commutative Rings R Whose C(𝔸𝔾(R)) Consist of Only Triangles
- Covering codes of a graph associated with a finite vector space
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- scientific article; zbMATH DE number 3841894 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- Identifying and locating-dominating codes on chains and cycles
- Identifying codes in trees and planar graphs
- Identifying codes of degree 4 Cayley graphs over abelian groups
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- Minimum sizes of identifying codes in graphs differing by one edge
- Minimum sizes of identifying codes in graphs differing by one vertex
- On a new class of codes for identifying vertices in graphs
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
- On identifying codes in the Cartesian product of a path and a complete graph
- On the coloring of the annihilating-ideal graph of a commutative ring
- The annihilating-ideal graph of \(\mathbb{Z}_n\) is weakly perfect
- The annihilating-ideal graph of commutative rings. I
This page was built for publication: Commutative rings introduce a class of identifiable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6670665)
