Results 11 to 20 of about 1,529,529 (310)
Groups whose prime graphs have no triangles [PDF]
, 2013 Let G be a finite group and let cd(G) be the set of all complex irreducible character degrees of G Let \rho(G) be the set of all primes which divide some character degree of G. The prime graph \Delta(G) attached to G is a graph whose vertex set is \rho(G)
Tong-Viet, Hung P.
core +3 more sources
Prime Labelings of Snake Graphs
The PUMP Journal of Undergraduate Research, 2019 A prime labeling of a graph G with n vertices is a labeling of the vertices with distinct integers from the set {1, 2 ,..., n} such that the labels of any two adjacent vertices are relatively prime.
A. Bigham +4 more
semanticscholar +3 more sources
Journal of CombinatoricsThe decomposition of complex networks into smaller, interconnected components is a central challenge in network theory with a wide range of potential applications.
Maria Chudnovsky +6 more
semanticscholar +3 more sources
Diagonalized Cartesian products of s-prime graphs are s-prime
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marc Hellmuth +2 more
semanticscholar +3 more sources
The prime graphs of groups with arithmetically small composition factors [PDF]
Annali di Matematica Pura ed Applicata, 2022 We continue the study of prime graphs of finite groups, also known as Gruenberg–Kegel graphs. The vertices of the prime graph of a finite group are the prime divisors of the group order, and two vertices p and q are connected by an edge if and only if ...
Timothy J. Edwards +3 more
semanticscholar +1 more source
Resolving Prime Modules: The Structure of Pseudo-cographs and Galled-Tree Explainable Graphs [PDF]
Discrete Applied Mathematics, 2022 The modular decomposition of a graph $G$ is a natural construction to capture key features of $G$ in terms of a labeled tree $(T,t)$ whose vertices are labeled as"series"($1$),"parallel"($0$) or"prime". However, full information of $G$ is provided by its
Marc Hellmuth, G. Scholz
semanticscholar +1 more source
A classification of the prime graphs of pseudo-solvable groups
Journal of group theroy, 2023 The prime graph Γ ( G ) \Gamma(G) of a finite group 𝐺 (also known as the Gruenberg–Kegel graph) has as its vertices the prime divisors of | G | \lvert G\rvert , and p - q p\textup{-}q is an edge in Γ ( G ) \Gamma(G) if and only if 𝐺 has an ...
Ziyu Huang +5 more
semanticscholar +1 more source
Odd Prime Labeling For Some Arrow Related Graphs
Ratio Mathematica, 2023 In a graph G a mapping g is known as odd prime labeling , if g is a bijection from V to f1; 3; 5; ::::; 2jVj - 1g satisfying the condition that for each line xy in G the gcd of the labels of end points (g(x); g(y)) is one.
Gajalakshmi G, Meena S
doaj +1 more source
On the WL-dimension of circulant graphs of prime power order [PDF]
Algebraic Combinatorics, 2022 The WL-dimension of a graph X is the smallest positive integer m such that the m-dimensional Weisfeiler-Leman algorithm correctly tests the isomorphism between X and any other graph.
Ilia N. Ponomarenko
semanticscholar +1 more source
Gruenberg–Kegel graphs: Cut groups, rational groups and the prime graph question [PDF]
Forum mathematicum, 2021 The Gruenberg–Kegel graph of a group is the undirected graph whose vertices are those primes which occur as the order of an element of the group, and distinct vertices p, q are joined by an edge whenever the group has an element of order pq.
A. Bächle +3 more
semanticscholar +1 more source