Related papers: Character degree graph of solvable groups with odd…

If the vertices of a graph $G$ are colored with $k$ colors such that no adjacent vertices receive the same color and the sizes of any two color classes differ by at most one, then $G$ is said to be equitably $k$-colorable. Let $|G|$ denote…

A spanning subgraph $F$ of a graph $G$ is called a $[1,b]$-odd factor if $b\equiv1$ (mod 2) and $d_F(v)\in\{1,3,\ldots,b\}$ for every $v\in V(G)$. A graph $G$ of order $n\geq k+2$ is $k$-critical with respect to $[1,b]$-odd factor if for…

We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.

We investigate the finite groups $G$ for which $\chi(1)^{2}=|G:Z(\chi)|$ for all characters $\chi \in Irr(G)$ and $|cd(G)|=2$, where $cd(G)=\{\chi(1)| \chi \in Irr(G)\}$. We call such a group a GVZ-group with two character degrees. We…

A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…

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…

In this paper, we investigate odd graceful graph, odd strongly harmonious graph, bipartite graph and their relationship. We proved following results: (1) if G is odd strongly harmonious graph, then G is odd graceful graph ;(2) if G is…

A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in path-pairable planar graphs. We show that any $n$-vertex…

In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our…

Let $G$ be a group and $Sol(G)=\{x \in G : \langle x,y \rangle \text{ is solvable for all } y \in G\}$. We associate a graph $\mathcal{NS}_G$ (called the non-solvable graph of $G$) with $G$ whose vertex set is $G \setminus Sol(G)$ and two…

We present some variations on some of the main open problems on character degrees. We collect some of the methods that have proven to be very useful to work on these problems. These methods are also useful to solve certain problems on zeros…

Let $G$ be a group of odd order and $\chi$ be a complex irreducible character. Then there exists a unique character $\chi^{(2)}\in\Irr(G)$ such that $[\chi^2,\chi^{(2)}]$ is odd. Also, there exists a unique character $\psi\in \Irr(G)$ such…

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

Given a finite group $G$, denote by ${\rm D}(G)$ the degree pattern of $G$ and by ${\rm OC}(G)$ the set of all order components of $G$. Denote by $h_{{\rm OD}}(G)$ (resp. $h_{{\rm OC}}(G)$) the number of isomorphism classes of finite groups…

For a positive integer $k\ge 1$, a graph $G$ is $k$-stepwise irregular ($k$-SI graph) if the degrees of every pair of adjacent vertices differ by exactly $k$. Such graphs are necessarily bipartite. Using graph products it is demonstrated…

A group $G$ is complete group if it satisfies $Z(G)=e$ and $Aut(G)=Inn(G)$. In this paper, on the one hand, we study the basic properties of generalized Cayley graphs and characterize two classes isomorphic generalized generalized Cayley…

Let $ G $ be a finite group and $ \chi \in \mathrm{Irr}(G) $. Define $ \mathrm{cv}(G)=\{\chi(g)\mid \chi \in \mathrm{Irr}(G), g\in G \} $, $ \mathrm{cv}(\chi)=\{\chi(g)\mid g\in G \} $ and denote $ \mathrm{dl}(G) $ by the derived length of…

This note gives necessary and sufficient conditions for a sequence of non-negative integers to be the degree sequence of a connected simple graph. This result is implicit in a paper of Hakimi. A new alternative characterisation of these…

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

In this note, we prove that if every character of a finite group $G$ fixed by an order-2 Galois automorphism has odd degree, then $G$ has a normal Sylow $2$-subgroup. On the way, we study extensions of characters of $GL_n(q)$, $q$ odd, to…