The domination game played on diameter 2 graphs

Aequationes mathematicae - Let $$\gamma _g(G)$$ be the game domination number of a graph G. It is proved that if $$\mathrm{diam}(G) = 2$$ , then $$\gamma _g(G) \le \left\lceil \frac{n(G)}{2}...     

On toric ideals arising from signed graphs

Journal of Algebraic Combinatorics - A signed graph is a pair $$(G,\tau )$$ of a graph G and its sign $$\tau $$ , where a sign $$\tau $$ is a function from $$\{ (e,v)\mid e\in E(G),v\in V(G), v\in...     

Orders generated by character values

Let $$K:=\mathbb {Q}(G)$$ be the number field generated by the complex character values of a finite group G. Let $$\mathbb {Z}_K$$ be the ring of integers of K. In this paper we investigate the suborder $$\mathbb {Z}[G]$$ of $$\mathbb {Z}_K$$ generated by the character values of G. We prove that every prime divisor of the order of the finite abelian group $$\mathbb {Z}_K/\mathbb {Z}[G]$$ divides |G|. Moreover, if G is nilpotent, we show that the exponent of $$\mathbb {Z}_K/\mathbb {Z}[G]$$ is a proper divisor of |G| unless $$G=1$$. We conjecture that this holds for arbitrary finite groups G.     

A result on the sum of element orders of a finite group

Let G be a finite group and $$\psi (G)=\sum _{g\in {G}}{o(g)}$$. There are some results about the relation between $$\psi (G)$$ and the structure of G. For instance, it is proved that if G is a group of order n and $$\psi (G)>\dfrac{211}{1617}\psi (C_n)$$, then G is solvable. Herzog et al. in (J Algebra 511:215–226, 2018) put forward the following conjecture: Conjecture. If G is a non-solvable group of order n, then $$\begin{aligned} {\psi (G)}\,{\le }\,{{\dfrac{211}{1617}}{\psi (C_n)}}, \end{aligned}$$with equality if and only if $$G \cong A_5$$. In particular, this inequality holds for all non-Abelian simple groups. In this paper, we prove a modified version of Herzog’s Conjecture.     

Exponent of a finite group of odd order with an involutory automorphism

Let $$w = w(x_1, \ldots , x_n)$$ be a non-trivial word of n-variables. The word map on a group G that corresponds to w is the map $$\widetilde{w}: G^n\rightarrow G$$ where $$\widetilde{w}((g_1, \ldots , g_n)) := w(g_1, \ldots , g_n)$$ for every sequence $$(g_1, \ldots , g_n)$$ . Let $$\mathcal G$$ be a simple and simply connected group which is defined and split over an infinite field K and let $$G =\mathcal G(K)$$ . For the case when $$w = w_1w_2 w_3 w_4$$ and $$w_1, w_2, w_3, w_4$$ are non-trivial words with independent variables, it has been proved by Hui et al. (Israel J Math 210:81–100, 2015) that $$G{\setminus } Z(G) \subset {{\text { Im}}}\,\widetilde{w}$$ where Z(G) is the center of the group G and $${{\text { Im}}}\, {\widetilde{w}}$$ is the image of the word map $$\widetilde{w}$$ . For the case when $$G = {{\text {SL}}}_n(K)$$ and $$n \ge 3$$ , in the same paper of Hui et al. (2015) it was shown that the inclusion $$G{\setminus } Z(G)\subset {{\text { Im}}}\,\widetilde{w}$$ holds for a product $$w = w_1w_2 w_3$$ of any three non-trivial words $$ w_1, w_2, w_3$$ with independent variables. Here we extent the latter result for every simple and simply connected group which is defined and split over an infinite field K except the groups of types $$B_2, G_2$$ .     

Smallest graphs with given automorphism group

Journal of Algebraic Combinatorics - For a finite group G, denote by $$\alpha (G)$$ the minimum number of vertices of any graph $$\Gamma $$ having $$\mathrm {Aut}(\Gamma )\cong G$$ . In this paper,...     

Extensions of the sine addition law on groups

Aequationes mathematicae - Let G be a group, and let $$\chi $$ and $$\mu $$ be characters of G. We find the solutions of the functional equation $$f(xy) = f(x)\chi (y) + \mu (x)f(y)$$ , $$x,y \in...     

Normal subgroup based power graph of finite groups

Ricerche di Matematica - Let G be a finite group and $$N \unlhd G$$ . The normal subgroup based power graph of G, $$\Gamma _N(G)$$ , is an undirected graph with vertex set $$(G{\setminus }N) \cup...     

On theorems of Brauer-Nesbitt and Brandt for characterizations of small block algebras

Let A be a finite group acting on a finite group G via automorphisms. Assume that $$(|A|,|G|)=1$$ . We prove that if $$C_G(A)$$ is a Hall $$\pi $$ -subgroup of G, then G has a normal $$\pi $$ -complement.     

On Products of $$\mathrm{F}^*(G)$$ -Subnormal Subgroups of Finite Groups

Mathematical Notes - A subgroup $$H$$ of a finite group $$G$$ is said to be $$\mathrm{F}^*(G)$$ -subnormal if it is subnormal in $$H\mathrm{F}^*(G)$$ , where $$\mathrm{F}^*(G)$$ is the generalized...     

Non-Abelian tensor square and related constructions of p-groups

Archiv der Mathematik - Let G be a group. We denote by $$\nu (G)$$ a certain extension of the non-Abelian tensor square $$[G,G^{\varphi }]$$ by $$G \times G$$. We prove that if G is a finite potent...     

Extremal Problems on Components and Loops in Graphs

The authors recently defined a new graph invariant denoted by Ω(G) only in terms of a given degree sequence which is also related to the Euler characteristic. It has many important combinatorial applications in graph theory and gives direct information compared to the better known Euler characteristic on the realizability, connectedness, cyclicness, components, chords, loops etc. Many similar classification problems can be solved by means of Ω. All graphs G so that Ω(G) ≤-4 are shown to be disconnected, and if Ω(G) ≥-2, then the graph is potentially connected. It is also shown that if the realization is a connected graph and Ω(G) =-2, then certainly the graph should be a tree.Similarly, it is shown that if the realization is a connected graph G and Ω(G) ≥ 0, then certainly the graph should be cyclic. Also, when Ω(G) ≤-4, the components of the disconnected graph could not all be cyclic and if all the components of G are cyclic, then Ω(G) ≥ 0. In this paper, we study an extremal problem regarding graphs. We find the maximum number of loops for three possible classes of graphs.We also state a result giving the maximum number of components amongst all possible realizations of a given degree sequence.     

A note on commutator subgroups in groups of large cardinality

Monatshefte für Mathematik - If G is an uncountable group of regular cardinality $$\aleph $$, we shall denote by $${\mathfrak {L}L}_\aleph (G)$$ the set of all subgroups of G of cardinality...     

On the Second Smallest and the Largest Normalized Laplacian Eigenvalues of a Graph

Acta Mathematicae Applicatae Sinica, English Series - Let G be a simple connected graph with order n. Let $$\mathcal{L}(G)$$ and $$\mathcal{Q}(G)$$ be the normalized Laplacian and normalized...     

On p-nilpotence and $$IC{\Phi}$$ I C Φ -subgroups of finite groups

Acta Mathematica Hungarica - A subgroup H of a group G is said to be an $$IC\mathrm{\Phi}$$ -subgroup of G if $$H \cap [H,G] \le \mathrm{\Phi}(H)$$ . We prove the p-nilpotency of a finite group G...     

On m- $$\sigma$$ σ -embedded subgroups of finite groups

Acta Mathematica Hungarica - Let $$\sigma =\{\sigma_i |i\in I\}$$ be some partition of the set of all primes $$\mathbb{P}$$ and G be a finite group. A group is said to be $$\sigma$$ -primary if it...     

Some sufficient conditions for path-factor uniform graphs

Aequationes mathematicae - For a set $$\mathcal {H}$$ of connected graphs, a spanning subgraph H of G is called an $$\mathcal {H}$$ -factor of G if each component of H is isomorphic to an element...     

A note on a functional equation on groups with involutions in two variables

Aequationes mathematicae - In this paper, we determine the central solutions $$f:G\times G\rightarrow {{\mathbb {C}}}$$ of the functional equation $$\begin{aligned} f(x_1\sigma y_1,x_2\tau...     

An $$\mathcal{O}(m\log n)$$ algorithm for the weighted stable set problem in claw-free graphs with $$\alpha ({G}) \le 3$$

Mathematical Programming - In this paper we show how to solve the Maximum Weight Stable Set Problem in a claw-free graph G(V, E) with $$\alpha (G) \le 3$$ in time $$\mathcal{O}(|E|\log...     

Finite Groups with Formation Subnormal Normalizers of Sylow Subgroups

Mathematical Notes - Let $$\mathfrak{F}$$ be a formation. Properties of the class $$\mathrm{w}^{*}\mathfrak{F}$$ of all groups $$G$$ for which $$\pi(G)\subseteq\pi(\mathfrak{F})$$ and the...