4 problems

Incidence-code parameter conjecture. The paper conjectures the corresponding general formulas for the linear codes generated by incidence matrices of…

Connectivity and diameter conjecture. If both $m$ and $n$ are odd, then $G(\mathbb{Z}_{n}\oplus\mathbb{Z}_{m})$ is connected and

Let $n$ be a natural number, let $G(\mathbb{Z}_n)$ be a unit graph, and let $H$ be a $|V|\times|E|$ incidence matrix of $G(\mathbb{Z}_n)$. Let $\phi(n)$ denote Euler's totient func…

Let $n$ be a natural number, and let $G(\mathbb{Z}_n)$ be the unit graph. Write $U(\mathbb{Z}_n)$ for its set of units, $N_U(\mathbb{Z}_n)$ for its set of non-units, and…