相关论文: Genus, thickness and crossing number of graphs enc…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

The power graph $\Gamma_G$ of a finite group $G$ is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. In this paper, we classify the finite groups whose power graphs have…

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes excluding~$1$. Let us define a directed graph $\Gamma(G)$, the set of vertices of this graph is $N(G)$ and the vertices $x$ and $y$ are connected by a directed…

Let $G$ be a finite non-cyclic group. The non-cyclic graph $\Gamma_G$ of $G$ is the graph whose vertex set is $G\setminus Cyc(G)$, two distinct vertices being adjacent if they do not generate a cyclic subgroup, where $Cyc(G)=\{a\in G:…

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…

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

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…

Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…

Given a finite group $G$, the invariably generating graph of $G$ is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of $G$, and two classes are adjacent if and only if they invariably generate $G$.…

For a finite group $G$ denote by $\gamma(L(G))$ the genus of the subgroup graph of $G.$ We prove that $\gamma(L(G))$ tends to infinity as either the rank of $G$ or the number of prime divisors of $|G|$ tends to infinity.

This paper studies questions about duality between crossings and non-crossings in graph drawings via the notions of thickness and antithickness. The "thickness" of a graph $G$ is the minimum integer $k$ such that in some drawing of $G$, the…

Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in…

An $L(2,1)$-labelling of a finite graph $\Gamma$ is a function that assigns integer values to the vertices $V(\Gamma)$ of $\Gamma$ (colouring of $V(\Gamma)$ by ${\mathbb{Z}}$) so that the absolute difference of two such values is at least…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

For a finite group $G,$ we investigate the direct graph $\Gamma(G),$ whose vertices are the non-hypercentral elements of $G$ and where there is an edge $x\mapsto y$ if and only if $[x,_ny]=1$ for some $n \in \mathbb N.$ We prove that…

The cyclic subgroup graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with cyclic subgroups as a vertex set and two distinct vertices $H_1$ and $H_2$ are adjacent if and only if $H_1 \leq H_2$ and there does not exist any…

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 of order $ n$. The strong power graph $\mathcal{P}_s(G) $ of $G$ is the undirected graph whose vertices are the elements of $G$ such that two distinct vertices $a$ and $b$ are adjacent if $a^{{m}_1}$=$b^{{m}_2}$…

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…