相关论文: Separating rank 3 graphs

We study three restrictions on normalizers or centralizers in finite p-groups, namely: (i) |N_G(H) : H| <= p^k for every H non-normal in G, (ii) |N_G(<g>) : <g>| <= p^k for every <g> non-normal in G, and (iii) |C_G(g) : <g>| <= p^k for…

Transfinite graphs have been defined and examined in a variety of prior works, but transfinite digraphs had not as yet been investigated. The present work embarks upon such a task. As with the ordinals, transfinite digraphs appear in a…

The prime graph question asks whether the Gruenberg-Kegel graph of an integral group ring $\mathbb Z G$ , i.e. the prime graph of the normalised unit group of $\mathbb Z G$ coincides with that one of the group $G$. In this note we prove for…

We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.

Let G be a finite group and let Irr(G) be the set of all irreducible complex characters of G. Let cd(G) be the set of all character degrees of G and denote by \rho(G) the set of primes which divide some character degrees of G. The prime…

In recent years, we have seen several approaches to the graph isomorphism problem based on "generic" mathematical programming or algebraic (Gr\"obner basis) techniques. For most of these, lower bounds have been established. In fact, it has…

Interval and proper interval graphs are very well-known graph classes, for which there is a wide literature. As a consequence, some generalizations of interval graphs have been proposed, in which graphs in general are expressed in terms of…

We show that in the free group of rank 3, given an arbitrary number of automorphisms, the intersection of their fixed subgroups is equal to the fixed subgroup of some other single automorphism.

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…

In this paper, an effort is made to classify which prime character degree graphs having eight vertices occur for some finite solvable group. To approach this, we compile known results and constructions from the literature which are used to…

We prove that non-abelian free groups of finite rank at least 3 or of countable rank are not $\forall$-homogeneous. We answer three open questions from Kharlampovich, Myasnikov, and Sklinos regarding whether free groups, finitely generated…

We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…

Consider a graphed holomorphic surface $u=F(x,y)$ in $\mathbb{C}^3_{x,y,u}$ under the action of the affine transformation group $A(3)$. In 1999, Eastwood and Ezhov obtained a list of homogeneous models by determining possible tangential…

The graph isomorphism problem is a main problem which has numerous applications in different fields. Thus, finding an efficient and easy to implement method to discriminate non-isomorphic graphs is valuable. In this paper, a new method is…

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…

We classify (possibly non commutative) algebras of low rank over a domain R. We first review results for algebras of rank 2 and for finite-dimensional division algebras over the real numbers. These results motivate us to consider which…

Let $G = (V, E)$ be a connected graph with maximum degree $k\geq 3$ distinct from $K_{k+1}$. Given integers $s \geq 2$ and $p_1,\ldots,p_s\geq 0$, $G$ is said to be $(p_1, \dots, p_s)$-partitionable if there exists a partition of $V$ into…

For a fixed set ${\cal H}$ of graphs, a graph $G$ is ${\cal H}$-subgraph-free if $G$ does not contain any $H \in {\cal H}$ as a (not necessarily induced) subgraph. A recently proposed framework gives a complete classification on ${\cal…

We give a necessary condition of generic 3 -rigidity of graphs relying on partitioning the edges into 3 subsets; such that each subset-pair gives a generically 2-rigid graph, either by themselves or after an appropriate edge-deletion.…

A group of permutations G of a set V is k-distinguishable if there exists a partition of V into k parts such that only the identity permutation in G fixes setwise all of the cells of the partition. The least cardinal number k such that…