Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Rai, Kartikeya"'
For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. The it is well known that only finitely many positive integers do not bel
Externí odkaz:
http://arxiv.org/abs/2411.04465
A graph $G$ is cordial if there exists a function $f$ from the vertices of $G$ to $\{0,1\}$ such that the number of vertices labelled $0$ and the number of vertices labelled $1$ differ by at most $1$, and if we assign to each edge $xy$ the label $|f(
Externí odkaz:
http://arxiv.org/abs/2411.04458