Related papers: Congruence and Noncongruence Subgroups of Gamma(2)…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…
For a graph $G = (V, E)$, the $\gamma$-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent if they differ by a single vertex and the two…
We prove the existence of surface subgroups within any cocompact lattice $\Gamma$ in $\mathrm{SO}(2n,1)$ for $n\geq2$. This result addresses the cases missing from the work of Hamenst\"adt in 2015, who constructed surface subgroups in…
In this paper we give a description of the generators of the prime level congruence subgroups of braid groups. Also, we give a new presentation of the symplectic group over a finite field, and we calculate symmetric quotients of the prime…
Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…
It is known that the level $2$ principal congruence subgroup of $GL(n;\mathbb{Z})$ has a finite generating set. In this paper, we give a finite presentation of the level $2$ principal congruence subgroup of $GL(n;\mathbb{Z})$.
Assume that $G$ is a finite group and let $a$ and $b$ be non-negative integers. We define an undirected 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…
Congruences on a graph inverse semigroup were recently described in terms of the underline graph. Based on such descriptions, we show that the lattice of congruences on a graph inverse semigroup is upper semimodular but not lower…
A $k$-subcoloring of a graph is a partition of the vertex set into at most $k$ cluster graphs, that is, graphs with no induced $P_3$. 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs,…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…
Given a 2-generated finite group $G$, the non-generating graph of $G$ has as vertices the elements of $G$ and two vertices are adjacent if and only if they are distinct and do not generate $G$. We consider the graph $\Sigma(G)$ obtained…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
We continue and complete our previous paper `Lifts of projective congruence groups' [2] concerning the question of whether there exist noncongruence subgroups of $\SL_2(\Z)$ that are projectively equivalent to one of the groups…
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…
We study the trace set of the commutator subgroup of $\Gamma(2),$ a type of Local-Global problem about thin groups. We determine the local obstructions and then use the correspondence between binary quadratic forms and hyperbolic matrices…
Subgraph enumeration problems ask to output all subgraphs of an input graph that belongs to the specified graph class or satisfy the given constraint. These problems have been widely studied in theoretical computer science. As far, many…
The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…