Related papers: A graph related to the sum of element orders of a …

A finite group $G$ is called $\psi$-divisible if $\psi(H)|\psi(G)$ for any subgroup $H$ of $G$, where $\psi(H)$ and $\psi(G)$ are the sum of element orders of $H$ and $G$, respectively. In this paper, we extend a result provided in [10], by…

A finite group $G$ is said to be a $\mathcal{B}_{\psi}$-group if $\psi(H)<|G|$ for any proper subgroup $H$ of $G$, where $\psi(H)$ denotes the sum of element orders of $H$. In this paper, we characterize the $\mathcal{B}_{\psi}$-groups up…

This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…

Let $\Gamma$ be an undirected and simple graph. 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 each containing a cycle. If $\Gamma$ has a…

We associate a graph $\Gamma_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | \left<x,y\right> \text{is cyclic for all} y\in G\}$, and…

Let $G$ be a finite group. Denoting by ${\rm{cd}}(G)$ the set of the degrees of the irreducible complex characters of $G$, we consider the {\it character degree graph} of $G$: this is the (simple, undirected) graph whose vertices are the…

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…

Let $G$ be a finite group. Then we denote $\psi(G) = \sum_{x\in G}o(x)$ where $o(x)$ is the order of the element $x$ in $G$. In this paper we characterize some finite $p$-groups ($p$ a prime) by $\psi$ and their orders.

The non-solvable graph of a finite group G is a simple graph whose vertices are the elements of G and there is an edge between x and y if and only if the subgroup generated by x and y is not solvable. The isolated vertices in the…

Let $\psi(G) = \sum_{g \in G} o(g)$ denote the sum of element orders of a finite group $G$. It is known that among groups of order $n$, the cyclic group $C_n$ maximizes $\psi$. T\u{a}rn\u{a}uceanu proved that two finite abelian $p$-groups…

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

The power graph $\mathcal{P}(G)$ is the simple undirected graph with group elements as a vertex set and two elements are adjacent if one of them is a power of the other. The order supergraph $\mathcal{S}(G)$ of the power graph…

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…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…

The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…

The divisibility graph $D(G)$ for a finite group $G$ is a graph with vertex set $cs~(G)\setminus\{1\}$ where $cs~(G)$ is the set of conjugacy class sizes of $G$. Two vertices $a$ and $b$ are adjacent whenever $a$ divides $b$ or $b$ divides…

Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an…

The power graph $\mathcal P_G$ of a finite group $G$ is the graph with the vertex set $G$, where two elements are adjacent if one is a power of the other. We first show that $\mathcal P_G$ has an transitive orientation, so it is a perfect…

The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having…