ﻻ يوجد ملخص باللغة العربية
Let $overrightarrow{G}$ be a directed graph with no component of orderless than~$3$, and let $Gamma$ be a finite Abelian group such that $|Gamma|geq 4|V(overrightarrow{G})|$ or if $|V(overrightarrow{G})|$ is large enough with respect to an arbitrarily fixed $varepsilon>0$ then $|Gamma|geq (1+varepsilon)|V(overrightarrow{G})|$. We show that there exists an injective mapping $varphi$ from $V(overrightarrow{G})$ to the group $Gamma$ such that $sum_{xin V(C)}varphi(x) = 0$ for every connected component $C$ of $overrightarrow{G}$, where $0$ is the identity element of $Gamma$. Moreover we show some applications of this result to group distance magic labelings.
We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this notion of cu
A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to a subset $S$ of $G$ is called normal if the right regular representation of $G$ is a normal subgroup in the full automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if for every
A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to $S$ is said to be normal if the right regular representation of $G$ is normal in the automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if there is $alphain Aut(G)$ such that $S
A subset $B$ of a group $G$ is called a difference basis of $G$ if each element $gin G$ can be written as the difference $g=ab^{-1}$ of some elements $a,bin B$. The smallest cardinality $|B|$ of a difference basis $Bsubset G$ is called the difference
Let $(G, +)$ be an abelian group. In 2004, Eliahou and Kervaire found an explicit formula for the smallest possible cardinality of the sumset $A+A$, where $A subseteq G$ has fixed cardinality $r$. We consider instead the smallest possible cardinality