Related papers: Determining sets and determining numbers of finite…

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$.The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

For a finite group $G$ let $\sigma(G)$ (the "sum" of $G$) be the least number of proper subgroups of $G$ whose set-theoretical union is equal to $G$, and $\sigma(G)=\infty$ if $G$ is cyclic. We say that a group $G$ is $\sigma$-elementary if…

For a finite group $G$ and an element $x\in G$, the subset $$ nil_G(x)=\{y\in G \mid <x,y>~~ is ~~ nilpotent\}$$ is called nilpotentizer of $x$ in $G$. In this paper, we give two solvabilty criteria for a finite group by the structure and…

A set $D$ of vertices of a simple graph $G=(V,E)$ is a strong dominating set, if for every vertex $x\in \overline{D}=V\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\leq deg(y)$. The strong domination number…

For any group G, let C(G) denote the intersection of the normal- izers of centralizers of all elements of G. Set C0 = 1. Define Ci+1(G)=Ci(G) = C(G=Ci(G)) for i ? 0. By C1(G) denote the terminal term of the ascending series. In this paper,…

Let $G$ be a finite group and $N_{\Omega}(G)$ be the intersection of the normalizers of all subgroups belonging to the set $\Omega(G),$ where $\Omega(G)$ is a set of all subgroups of $G$ which have some theoretical group property. In this…

A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…

Let $G$ be a graph. A dominating set $D\subseteq V(G)$ is a super dominating set if for every vertex $x\in V(G) \setminus D$ there exists $y\in D$ such that $N_G(y)\cap (V(G)\setminus D)) = \{x\}$. The cardinality of a smallest super…

A set $D$ of vertices of a graph $G$ is a dominating set of $G$ if every vertex in $V_G-D$ is adjacent to at least one vertex in $D$. The domination number (upper domination number, respectively) of a graph $G$, denoted by $\gamma(G)$…

For every group of order at most 14 we determine the values taken by its group determinant when its variables are integers.

Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…

A subset $S$ of vertices of $G$ is a \textit{dominating set} of $G$ if every vertex in $V(G)-S$ has a neighbor in $S$. The \textit{domination number} \(\gamma(G)\) is the minimum cardinality of a dominating set of $G$. A dominating set $S$…

A dominating set of a graph $G$ is a subset $D \subseteq V_G$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is the domination number…

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

A positive integer $m$ will be called a {\it finitistic order} for an element $\gamma$ of a group $\Gamma$ if there exist a finite group $G$ and a homomorphism $h:\Gamma\to G$ such that $h(\gamma)$ has order $m$ in $G$. It is shown that up…

A set of vertices $S$ is a \emph{determining set} of a graph $G$ if every automorphism of $G$ is uniquely determined by its action on $S$. The \emph{determining number} of $G$ is the minimum cardinality of a determining set of $G$. This…

An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.

Given a finite group $G$, we denote by $L(G)$ the subgroup lattice of $G$ and by ${\rm Isolated}(G)$ the set of isolated subgroups of $G$. In this note, we describe finite groups $G$ such that $|{\rm Isolated}(G)|=|L(G)|-k$, where…

A group $G$ is said to have dense normalizers if each non-empty open interval in its subgroup lattice $L(G)$ contains the normalizer of a certain subgroup of $G$. In this note, we find all finite groups satisfying this property. We also…