Prime Graph Research Articles

Induced saturation of graphs

A graph G is H-saturated for a graph H, if G does not contain a copy of H but adding any new edge to G results in such a copy. An H-saturated graph on a given number of vertices always exists and the properties of such graphs, for example their highest density, have been studied intensively.A graph G is H-induced-saturated if G does not have an induced subgraph isomorphic to H, but adding an edge to G from its complement or deleting an edge from G results in an induced copy of H. It is not immediate anymore that H-induced-saturated graphs exist. In fact, Martin and Smith (2012) showed that there is no P4-induced-saturated graph. Behrens et al. (2016) proved that if H belongs to a few simple classes of graphs such as a class of odd cycles of length at least 5, stars of size at least 2, or matchings of size at least 2, then there is an H-induced-saturated graph.This paper addresses the existence question for H-induced-saturated graphs. It is shown that Cartesian products of cliques are H-induced-saturated graphs for H in several infinite families, including large families of trees. A complete characterization of all connected graphs H for which a Cartesian product of two cliques is an H-induced-saturated graph is given. Finally, several results on induced saturation for prime graphs and families of graphs are provided.

Order Prime Graphs of Symmetric, Quaternion and Heisenberg Groups

Order Prime Graphs of Symmetric, Quaternion and Heisenberg Groups

Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs

A homogeneous set of a graph G is a set X of vertices such that 2≤|X|<|V(G)| and no vertex in V(G)−X has both a neighbor and a non-neighbor in X. A graph is prime if it has no homogeneous set. We present an algorithm to decide whether a class of graphs given by a finite set of forbidden induced subgraphs contains infinitely many non-isomorphic prime graphs.

Prime Labeling of Jahangir Graphs

The paper investigates prime labeling of Jahangir graph Jn,m for n ≥ 2, m ≥ 3 provided that nm is even. We discuss prime labeling of some graph operations viz. Fusion, Switching and Duplication to prove that the Fusion of two vertices v1 and vk where k is odd in a Jahangir graph Jn,m results to prime graph provided that the product nm is even and is relatively prime to k. The Fusion of two vertices vnm + 1 and vk for any k in Jn, m is prime. The switching of vk in the cycle Cnm of the Jahangir graph Jn,m is a prime graph provided that nm+1 is a prime number and the switching of vnm+1 in Jn, m is also a prime graph .Duplicating of vk, where k is odd integer and nm + 2 is relatively prime to k,k+2 in Jn,m is a prime graph.

Real class sizes

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is disconnected. Moreover, we show that if the sizes of all noncentral real conjugacy classes of a finite group G have the same 2-part and the Sylow 2-subgroup of G satisfies a certain condition, then G is solvable.

On nonsolvable groups whose prime degree graphs have four vertices and one triangle

‎Let $G$ be a finite group‎. ‎The prime degree graph of $G$‎, ‎denoted‎ ‎by $Delta(G)$‎, ‎is an undirected graph whose vertex set is $rho(G)$ and there is an edge‎ ‎between two distinct primes $p$ and $q$ if and only if $pq$ divides some irreducible‎ ‎character degree of $G$‎. ‎In general‎, ‎it seems that the prime graphs‎ ‎contain many edges and thus they should have many triangles‎, ‎so one of the cases that would be interesting is to consider those finite groups whose prime degree graphs have a small number of triangles‎. ‎In this paper we consider the case where for a nonsolvable group $G$‎, ‎$Delta(G)$ is a connected graph which has only one triangle and four vertices‎.

Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions

In the companion paper (Adler et al., 2017), we presented a characterization of the linear rank-width of distance-hereditary graphs, from which we derived an algorithm to compute it in polynomial time. In this paper, we investigate structural properties of distance-hereditary graphs based on this characterization.First, we prove that for a fixed tree T, every distance-hereditary graph of sufficiently large linear rank-width contains a vertex-minor isomorphic to T. We extend this property to bigger graph classes, namely, classes of graphs whose prime induced subgraphs have bounded linear rank-width. Here, prime graphs are graphs containing no splits. We conjecture that for every tree T, every graph of sufficiently large linear rank-width contains a vertex-minor isomorphic to T. Our result implies that it is sufficient to prove this conjecture for prime graphs.For a class Φ of graphs closed under taking vertex-minors, a graph G is called a vertex-minor obstruction for Φ if G∉Φ but all of its proper vertex-minors are contained in Φ. Secondly, we provide, for each k⩾2, a set of distance-hereditary graphs that contains all distance-hereditary vertex-minor obstructions for graphs of linear rank-width at most k. Also, we give a simpler way to obtain the known vertex-minor obstructions for graphs of linear rank-width at most 1.

Groups whose degree graph has three independent vertices

Let G be a finite group, and let cd(G) denote the set of degrees of the irreducible complex characters of G. This paper is a contribution to the study of the degree graph of G, that is, the prime graph built on the set cd(G). Namely, we characterize finite groups whose degree graph has three independent vertices (i.e., three vertices that are pairwise non-adjacent). Our result turns out to be a generalization of several previously-known theorems concerning the structure of the degree graph.

On normality of n-Cayley graphs

Let G be a finite group and X a (di)graph. If there exists a semiregular subgroup G¯ of the automorphism group Aut(X) isomorphic to G with n orbits on V(X) then the (di)graph X is called an n-Cayley graph on G. If, in addition, this subgroup G¯ is normal in Aut(X) then X is called a normal n-Cayley graph on G.In this paper the normalizers of semiregular subgroups of the automorphism group of a digraph are characterized. It is proved that every finite group admits a vertex-transitive normal n-Cayley graph for every n ≥ 2. For the most part the graphs are constructed as Cartesian product of graphs. It is proved that a Cartesian product of two relatively prime graphs is Cayley (resp. normal Cayley) if and only if the factor graphs are Cayley (resp. normal Cayley). In addition, the concept of graphical regular representations (GRRs) is generalized to n-GRR in a natural way, and it is proved that any group admitting a GRR also admits an n-GRR for any n ≥ 1.

Quasirecognition by Prime Graph of the Groups 2D2n(q) Where q &lt; 105

Let G be a finite group. The prime graph Γ ( G ) of G is defined as follows: The set of vertices of Γ ( G ) is the set of prime divisors of | G | and two distinct vertices p and p ′ are connected in Γ ( G ) , whenever G contains an element of order p p ′ . A non-abelian simple group P is called recognizable by prime graph if for any finite group G with Γ ( G ) = Γ ( P ) , G has a composition factor isomorphic to P. It is been proved that finite simple groups 2 D n ( q ) , where n ≠ 4 k , are quasirecognizable by prime graph. Now in this paper we discuss the quasirecognizability by prime graph of the simple groups 2 D 2 k ( q ) , where k ≥ 9 and q is a prime power less than 10 5 .

Castelnuovo-Mumford Regularity of Graphs

We present new combinatorial results on the calculation of (Castelnuovo-Mumford) regularity of graphs. We introduce the notion of a prime graph over a field k, which we define to be a connected graph with regk(G − x) < regk(G) for any vertex x ∈ V (G). We then exhibit some structural properties of prime graphs. This enables us to provide upper bounds to the regularity involving the induced matching number im(G). We prove that reg(G) ≤ (Γ(G)+1)im(G) holds for any graph G, where Γ(G)=max{|N G [x]\N G [y]| : xy ∈ E(G)} is the maximum privacy degree of G and N G [x] is the closed neighbourhood of x in G. In the case of claw-free graphs, we verify that this bound can be strengthened by showing that reg(G)≤2im(G). By analysing the effect of Lozin transformations on graphs, we narrow the search for prime graphs into graphs having maximum degree at most three. We show that the regularity of such graphs G is bounded above by 2im(G)+1. Moreover, we prove that any non-trivial Lozin operation preserves the primeness of a graph. That enables us to generate many new prime graphs from the existing ones.

On the Prime Graph Question for Integral Group Rings of 4-Primary Groups II

In this article the study of the Prime Graph Question for the integral group ring of almost simple groups which have an order divisible by exactly $4$ different primes is continued. We provide more details on the recently developed "lattice method" which involves the calculation of Littlewood-Richardson coefficients. We apply the method obtaining results complementary to those previously obtained using the HeLP-method. In particular the "lattice method" is applied to infinite series of groups for the first time. We also prove the Zassenhaus Conjecture for four more simple groups. Furthermore we show that the Prime Graph Question has a positive answer around the vertex $3$ provided the Sylow $3$-subgroup is of order $3$.

English

In the literature, there are several graphs related to a finite group G. Two of them are the character degree graph, denoted by ΔG), and the prime graph ΓG), In this paper we classify all finite groups whose character degree graphs are disconnected and coincide with their prime graphs. As a corollary, we find all finite groups whose character degree graphs are square and coincide with their prime graphs.

Relatively Prime Graph RPn

Relatively Prime Graph RPn

Cartesian products of directed graphs with loops

We show that every nontrivial finite or infinite connected directed graph with loops and at least one vertex without a loop is uniquely representable as a Cartesian or weak Cartesian product of prime graphs. For finite graphs the factorization can be computed in linear time and space.

On the character degree graph of solvable groups

Let \(G\) be a finite solvable group, and let \(\Delta(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). A fundamental result by P.P. Palfy asserts that the complement $\bar{\Delta}(G)$ of the graph \(\Delta(G)\) does not contain any cycle of length \(3\). In this paper we generalize Palfy's result, showing that $\bar{\Delta}(G)$ does not contain any cycle of odd length, whence it is a bipartite graph. As an immediate consequence, the set of vertices of \(\Delta(G)\) can be covered by two subsets, each inducing a complete subgraph. The latter property yields in turn that if \(n\) is the clique number of \(\Delta(G)\), then \(\Delta(G)\) has at most \(2n\) vertices. This confirms a conjecture by Z. Akhlaghi and H.P. Tong-Viet, and provides some evidence for the famous \emph{\(\rho\)-\(\sigma\) conjecture} by B. Huppert.

On unavoidable‐induced subgraphs in large prime graphs

AbstractChudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present article, we reprove their theorem using many of the same ideas, but with the key model‐theoretic ingredient of first determining the so‐called amount of stability of the graph. This approach changes the applicable Ramsey theorem, improves the bounds and offers a different structural perspective on the graphs in question. Complementing this, we give an infinitary proof that implies the finite result.

On the Gruenberg–Kegel graph of integral group rings of finite groups

The prime graph question asks whether the Gruenberg–Kegel graph of an integral group ring [Formula: see text], i.e. the prime graph of the normalized unit group of [Formula: see text], coincides with that one of the group [Formula: see text]. In this note, we prove for finite groups [Formula: see text] a reduction of the prime graph question to almost simple groups. We apply this reduction to finite groups [Formula: see text] whose order is divisible by at most three primes and show that the Gruenberg–Kegel graph of such groups coincides with the prime graph of [Formula: see text].

On the prime graph question for integral group rings of 4-primary groups I

We study the Prime Graph Question for integral group rings. This question can be reduced to almost simple groups by a result of Kimmerle and Konovalov. We prove that the Prime Graph Question has an affirmative answer for all almost simple groups having a socle isomorphic to [Formula: see text] for [Formula: see text], establishing the Prime Graph Question for all groups where the only non-abelian composition factors are of the aforementioned form. Using this, we determine exactly how far the so-called HeLP method can take us for (almost simple) groups having an order divisible by at most four different primes.

On finite simple classical groups over fields of different characteristics with coinciding prime graphs

Suppose that G is a finite group, π(G) is the set of prime divisors of its order, and ω(G) is the set of orders of its elements. We define a graph on π(G) with the following adjacency relation: different vertices r and s from π(G) are adjacent if and only if rs ∈ ω(G). This graph is called the Gruenberg–Kegel graph or the prime graph of G and is denoted by GK(G). Let G and G 1 be two nonisomorphic finite simple groups of Lie type over fields of orders q and q 1, respectively, with different characteristics. It is proved that, if G is a classical group of a sufficiently high Lie rank, then the prime graphs of the groups G and G 1 may coincide only in one of three cases. It is also proved that, if G = A 1(q) and G 1 is a classical group, then the prime graphs of the groups G and G 1 coincide only if {G, G 1} is equal to {A 1(9), A 1(4)}, {A 1(9), A 1(5)}, {A 1(7), A 1(8)}, or {A 1(49),2 A 3(3)}.