相关论文: Eulerian character degree graph

we obtain a necessary condition for the character degree graph with all of its vertices are odd degree of a finite solvable group G.

We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…

We give a sufficient and necessary condition for a Praeger-Xu graph to be a Cayley graph.

We prove that a planar graph is Gorenstein if and only if its independence complex is Eulerian.

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

If $G$ is a solvable group, we take $\Delta (G)$ to be the character degree graph for $G$ with primes as vertices. We prove that if $\Delta (G)$ is a square, then $G$ must be a direct product.

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…

Let $G$ be a finite solvable group, let $Irr(G)$ be the set of all complex irreducible characters of $G$ and let $cd(G)$ be the set of all degrees of characters in $Irr(G).$ Let $\rho(G)$ be the set of primes that divide degrees in $cd(G).$…

Let \(G\) be a finite group, and let \(\Delta(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). It is well known that, whenever \(\Delta(G)\) is connected, the diameter of…

In this paper, we continue the classification work done in the first paper of the same name. With careful modifications of our previous approach, we are able to deduce (with two notable exceptions) which members of the previously introduced…

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

Let $G$ be a finite solvable group and let $\Delta(G)$ be the character degree graph of $G$. In this paper, we obtain the metric dimension of certain character degree graphs. Specifically, we calculate the metric dimension for a regular…

A classical theorem on character degrees states that if a finite group has fewer than four character degrees, then the group is solvable. We prove a corresponding result on character values by showing that if a finite group has fewer than…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. Define then the character degree graph $\Delta(G)$ as the (simple undirected) graph whose vertices are the prime…

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…

We restrict the possibilities for the character degrees of $p$-groups $G$ satisfying $|G:G'| = p^2$. E.g. if $G$ is of maximal class and has an irreducible character of degree $> p$, then it has such a character of degree at most…

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 total weight $(k,k')$-choosable if for any total list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and each edge $e$ a set $L(e)$ of $k'$ real numbers, there is a proper total…

We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.

We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine…