Total perfect codes in graphs realized by commutative rings
Let $R$ be a commutative ring with unity not equal to zero and let $\Gamma(R)$ be a zero-divisor graph realized by $R$. For a simple, undirected, connected graph $G = (V, E)$, a {\it total perfect code} denoted by $C(G)$ in $G$ is a subset $C(G) \subseteq V(G)$ such that $|N(v) \cap C(G)| = 1$ for a...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2022-12-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | https://toc.ui.ac.ir/article_26081_b310028bfbd7cbc36e3ad3df8708b1fd.pdf |