Related papers: Non-nilpotent graph of a group

Let $A$ and $G$ be finite groups such that $A$ acts coprimely on $G$ by automorphisms. We provide a complete classification of a finite group $G$ in which every maximal $A$-invariant subgroup containing the normalizer of some $A$-invariant…

While a number of bounds are known on the zero forcing number $Z(G)$ of a graph $G$ expressed in terms of the order of a graph and maximum or minimum degree, we present two bounds that are related to the (upper) total domination number…

Let $H$ be a normal subgroup of a group $G$. The normal subgroup based power graph $\Gamma_H(G)$ of $G$ is the simple undirected graph with vertex set $V(\Gamma_H(G))= (G\setminus H)\cup \{e\}$ and two distinct vertices $a$ and $b$ are…

Let $G$ be a finite group. In this short note, we give a criterion of nilpotency of $G$ based on the existence of elements of certain order in each section of $G$.

Let $G$ be a group such that $G/Z(G)$ is finite and simple. The non-commuting, non-generating graph $\Xi(G)$ of $G$ has vertex set $G \setminus Z(G)$, with edges corresponding to pairs of elements that do not commute and do not generate…

Let ${G}$ be a finite non-abelian group. The non-commuting conjugacy class graph (abbreviated as NCCC-graph) of $G$ is a simple undirected graph whose vertex set is the set of conjugacy classes of non-central elements of $G$ and two…

Following J.S. Rose, a subgroup H of a group G is said contranormal in G if G = H^G . In a certain sense, contranormal subgroups are antipodes to subnormal subgroups. It is well known that a finite group is nilpotent if and only if it has…

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A set $I_0(G) \subseteq V(G)$ is a vertex independent set if no two vertices in $I_0(G)$ are adjacent in $G$. We study $\alpha_1(G)$, which is the maximum cardinality of a set…

We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.

Let G be a finite group and let cd(G) be the set of all complex irreducible character degrees of G Let \rho(G) be the set of all primes which divide some character degree of G. The prime graph \Delta(G) attached to G is a graph whose vertex…

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

Given a finite simplicial graph ${\cal G}$, the graph group $G{\cal G}$" is the group with generators in one-to-one correspondence with the vertices of ${\cal G}$ and with relations stating two generators commute if their associated…

A graph $G$ is said to be $\preceq$-ubiquitous, where $\preceq$ is the minor relation between graphs, if whenever $\Gamma$ is a graph with $nG \preceq \Gamma$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \preceq \Gamma$, where…

In this article, we introduce a new graph theoretic structure associated with a finite commutative ring, called nil clean divisor graph. For a ring $R$, nil clean divisor graph is denoted by $G_N(R)$, where the vertex set is $\{x\in R\,:\,…

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…

In this paper, we systematically investigate the nilpotentizer and nilpotent graph for a Lie superalgebra over the field of characteristic not equal to 2. First, we establish some fundamental properties of the nilpotentizer. Next, we show…

Consider a graph $\Gamma$. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic vertex cutset, then it…

The power graph of a group $G$ is the graph whose vertex set is $G$ and two distinct vertices are adjacent if one is a power of the other. In this paper, the minimum degree of power graphs of certain classes of cyclic groups, abelian…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…