Related papers: OD-Characterization of Some Linear Groups Over Bin…

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…

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 there is an element of order $pq$ in $G$. Prime graphs of solvable groups have…

If G is a (connected) complex Lie Group and Z is a generalized flag manifold for G, the the open orbits D of a (connected) real form G_0 of G form an interesting class of complex homogeneous spaces, which play an important role in the…

We consider the following generalization of dominating sets: Let $G$ be a host graph and $P$ be a pattern graph $P$. A dominating $P$-pattern in $G$ is a subset $S$ of vertices in $G$ that (1) forms a dominating set in $G$ \emph{and} (2)…

A group $G$ is self-similar if it admits a triple $(G,H,f)$ where $H$ is a subgroup of $G$ and $f: H \to G$ a simple homomorphism, that is, the only subgroup $K$ of $H$, normal in $G$ and $f$-invariant ($K^f \leq K$) is trivial. The group…

Let $\mathbf{G}$ be a connected reductive algebraic group over an algebraic closure $\overline{\mathbb{F}_p}$ of the finite field of prime order $p$ and let $F : \mathbf{G} \to \mathbf{G}$ be a Frobenius endomorphism with $G = \mathbf{G}^F$…

Let $\alpha(G)$ denote the cardinality of a maximum independent set, while $\mu(G)$ be the size of a maximum matching in $G=\left( V,E\right) $. Let $\xi(G)$ denote the size of the intersection of all maximum independent sets. It is known…

The algebraic degree $Deg(G)$ of a graph $G$ is the dimension of the splitting field of the adjacency polynomial of $G$ over the field $\mathbb{Q}$. It can be shown that for every positive integer $d$, there exists a circulant graph with…

Let G be a finite non-abelian simple group and let p be a prime. We classify all pairs (G,p) such that the sum of the complex irreducible character degrees of G is greater than the index of a Sylow p-subgroup of G. Our classification…

A graph $G$ is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is prime (either 2 or odd). We prove that…

Let $G$ denote a linear algebraic group over $\mathbf{Q}$ and $K$ and $L$ two number fields. Assume that there is a group isomorphism of points on $G$ over the finite adeles of $K$ and $L$, respectively. We establish conditions on the group…

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…

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these…

Given a finite group $G$, the character graph, denoted by $\Delta(G)$, for its irreducible character degrees is a graph with vertex set $\rho(G)$ which is the set of prime numbers that divide the irreducible character degrees of $G$, and…

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

We say that finite groups are isospectral if they have the same sets of orders of elements. It is known that every nonsolvable finite group $G$ isospectral to a finite simple group has a unique nonabelian composition factor, that is, the…

The enhanced power graph of a finite group $G$, denoted by $\mathcal{P}_E(G)$, is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. In this…

Let k be a perfect field of characteristic p > 0, and let G be a finite group. We consider the pointed G-curves over k associated by Harbater, Katz, and Gabber to faithful actions of G on k[[t]] over k. We use such "HKG G-curves" to…

A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it…