scholarly journals Groups whose degree graph has three independent vertices

2018 ◽  
Vol 512 ◽  
pp. 66-80 ◽  
Author(s):  
Silvio Dolfi ◽  
Khatoon Khedri ◽  
Emanuele Pacifici
Keyword(s):  
Degree Graph

Bounding Fitting Heights of Two Classes of Character Degree Graphs

2014 ◽  
Vol 21 (02) ◽  
pp. 355-360
Author(s):  
Xianxiu Zhang ◽  
Guangxiang Zhang
Keyword(s):  
Solvable Group ◽  
Disjoint Union ◽  
Character Degree ◽  
Finite Solvable Group ◽  
Total Degree ◽  
Character Degree Graph ◽  
Vertex Set ◽  
Fitting Height ◽  
Degree Graph

In this article, we prove that a finite solvable group with character degree graph containing at least four vertices has Fitting height at most 4 if each derived subgraph of four vertices has total degree not more than 8. We also prove that if the vertex set ρ(G) of the character degree graph Δ(G) of a solvable group G is a disjoint union ρ(G) = π1 ∪ π2, where |πi| ≥ 2 and pi, qi∈ πi for i = 1,2, and no vertex in π1 is adjacent in Δ(G) to any vertex in π2 except for p1p2 and q1q2, then the Fitting height of G is at most 4.

scholarly journals Matching Complexes, Bounded Degree Graph Complexes, and Weight Spaces of GLn-Complexes

2001 ◽  
Vol 239 (1) ◽  
pp. 77-92 ◽  
Author(s):  
Dikran B. Karaguezian ◽  
Victor Reiner ◽  
Michelle L. Wachs
Keyword(s):  
Bounded Degree ◽  
Graph Complexes ◽  
Degree Graph

Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph

2012 ◽  
Vol 39 (1) ◽  
pp. 57-74 ◽  
Author(s):  
Dan Guo ◽  
Xuegang Hu ◽  
Fei Xie ◽  
Xindong Wu
Keyword(s):  
Pattern Matching ◽  
Degree Graph

scholarly journals Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph

Algorithmica ◽  
2018 ◽  
Vol 81 (5) ◽  
pp. 1844-1858 ◽  
Author(s):  
Viresh Patel ◽  
Guus Regts
Keyword(s):  
Bounded Degree ◽  
Degree Graph

BOUNDING THE NUMBER OF IRREDUCIBLE CHARACTER DEGREES OF A FINITE GROUP IN TERMS OF THE LARGEST DEGREE

2013 ◽  
Vol 13 (02) ◽  
pp. 1350096 ◽  
Author(s):  
MARK L. LEWIS ◽  
ALEXANDER MORETÓ
Keyword(s):  
Finite Group ◽  
Irreducible Character ◽  
Character Degree ◽  
Character Degrees ◽  
Character Degree Graph ◽  
Prime Factors ◽  
Degree Graph ◽  
A Finite Group

We conjecture that the number of irreducible character degrees of a finite group is bounded in terms of the number of prime factors (counting multiplicities) of the largest character degree. We prove that this conjecture holds when the largest character degree is prime and when the character degree graph is disconnected.

scholarly journals On the character degree graph of finite groups

2019 ◽  
Vol 198 (5) ◽  
pp. 1595-1614 ◽  
Author(s):  
Zeinab Akhlaghi ◽  
Carlo Casolo ◽  
Silvio Dolfi ◽  
Emanuele Pacifici ◽  
Lucia Sanus
Keyword(s):  
Finite Groups ◽  
Character Degree ◽  
Character Degree Graph ◽  
Degree Graph

Recognition of the simple group PSL( $$2,p^{2}$$ 2 , p 2 ) by character degree graph and order

2014 ◽  
Vol 178 (2) ◽  
pp. 251-257 ◽  
Author(s):  
Behrooz Khosravi ◽  
Behnam Khosravi ◽  
Bahman Khosravi ◽  
Zahra Momen
Keyword(s):  
Simple Group ◽  
Character Degree ◽  
Character Degree Graph ◽  
Degree Graph
Sign in / Sign up

Export Citation Format

Share Document