English
Related papers

Related papers: Eulerian character degree graph

200 papers

Let $G$ be a finite insoluble group with soluble radical $R(G)$. In this paper we investigate the soluble graph of $G$, which is a natural generalisation of the widely studied commuting graph. Here the vertices are the elements in $G…

Group Theory · Mathematics 2022-11-07 Timothy C. Burness , Andrea Lucchini , Daniele Nemmi

Let $G$ be a finite group and let $\rm{Irr}(G)$ be the set of all irreducible complex characters of $G$. For a character $\chi \in \rm{Irr}(G)$, the number $\rm{cod}(\chi):=|G:\rm{ker}\chi|/\chi(1)$ is called the co-degree of $\chi$. The…

Group Theory · Mathematics 2020-08-07 Mahdi Ebrahimi

In this paper, we give a necessary and sufficient condition for the integrality of Cayley graphs over the dihedral group $D_n=\langle a,b\mid a^n=b^2=1,bab=a^{-1}\rangle$. Moreover, we also obtain some simple sufficient conditions for the…

Combinatorics · Mathematics 2016-06-08 Lu Lu , Qiongxiang Huang , Xueyi Huang

The Gruenberg-Kegel graph ${\rm GK}(G)=(V_G, E_G)$ of a finite group $G$ is a simple graph with vertex set $V_G=\pi(G)$, the set of all primes dividing the order of $G$, and such that two distinct vertices $p$ and $q$ are joined by an edge,…

Group Theory · Mathematics 2015-12-04 A. R. Moghaddamfar , S. Rahbariyan

A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…

Social and Information Networks · Computer Science 2017-07-03 Massimo Franceschet , Enrico Bozzo

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…

Group Theory · Mathematics 2018-11-06 Zeinab Akhlaghi , Silvio Dolfi , Emanuele Pacifici , Lucia Sanus

We give a necessary and sufficient condition for the fundamental group of a finite graph of groups with infinite cyclic edge groups to be acylindrically hyperbolic, from which it follows that a finitely generated group splitting over Z…

Group Theory · Mathematics 2015-09-21 J. O. Button

Let $H$ be an abelian subgroup of a finite group $G$ and $\pi$ the set of prime divisors of $|H|$. We prove that $|H O_{\pi}(G)/ O_{\pi}(G)|$ is bounded above by the largest character degree of $G$. A similar result is obtained when $H$ is…

Group Theory · Mathematics 2019-05-28 Nguyen Ngoc Hung , Yong Yang

We show that if G is a graph of sufficiently large order n containing as many r-cliques as the r-partite Turan graph of order n; then for some C>0 G has more than Cn^(r-1) (r+1)-cliques sharing a common edge unless G is isomorphic to the…

Combinatorics · Mathematics 2010-01-14 Bela Bollobas , Vladimir Nikiforov

It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented…

Combinatorics · Mathematics 2013-11-18 Stephen Huggett , Iain Moffatt

Let $k$ be an algebraically closed field of characteristic zero, $F$ be an algebraically closed extension of $k$ of transcendence degree one, and $G$ be the group of automorphisms over $k$ of the field $F$. The purpose of this note is to…

Algebraic Geometry · Mathematics 2009-04-07 M. Rovinsky

The prime graph of a finite group $G$, which is denoted by ${\rm GK}(G)$, is a simple graph whose vertex set is comprised of the prime divisors of $|G|$ and two distinct prime divisors $p$ and $q$ are joined by an edge if and only if there…

Group Theory · Mathematics 2015-02-19 B Akbari , A. R. Moghaddamfar

In this paper, we give a necessary and sufficient condition for the finiteness of Galois cohomology of unipotent groups over local fields of positive characteristic

Number Theory · Mathematics 2011-08-31 Nguyen Duy Tan

For a finite nonabelian group $G$ let $\rat(G)$ be the largest ratio of degrees of two nonlinear irreducible characters of $G$. We show that nonabelian composition factors of $G$ are controlled by $\rat(G)$ in some sense. Specifically, if…

Group Theory · Mathematics 2013-08-06 James P. Cossey , Hung Ngoc Nguyen

In this paper we shall be looking at several results relating Schur rings to sufficient conditions for a graph to be a graphical regular representation (GRR) of a finite group, and then applying these specifically in the case of certain…

Combinatorics · Mathematics 2024-01-09 Josef Lauri , Jonathan Ebejer

We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.

Group Theory · Mathematics 2019-02-28 Olga Varghese

The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is…

Group Theory · Mathematics 2021-02-17 Joachim König

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

Group Theory · Mathematics 2024-06-14 Melissa Lee , Tomasz Popiel

We prove that the order of a finite group $G$ with trivial solvable radical is bounded above in terms of ${\rm acd}(G)$, the average degree of the irreducible characters. It is not true that the index of the Fitting subgroup is bounded…

Group Theory · Mathematics 2022-10-04 Alexander Moretó

We consider the flexible list coloring problem, in which we have a graph $G$, a color list assignment $L:V(G) \rightarrow 2^{\mathbb N}$, and a set $U \subseteq V(G)$ of vertices such that each $u \in U$ has a preferred color $p(u) \in…

Combinatorics · Mathematics 2024-08-19 Richard Bi , Peter Bradshaw
‹ Prev 1 8 9 10 Next ›