Orbits of the actions of finite solvable groups

Suppose V is a completely reducible faithful G-module for a solvable group G, we show G has a “large” orbit on V. Specifically, there is $v\in V$ such that ${\mathbf{C}}_G(v)$ is contained in a normal subgroup of derived length 9 contained in the seventh ascending Fitting subgroup of G. This is in some ways best possible. This is applied to generate many theorems showing that a solvable group must have characters of large degree.     

Symmetric cubic graphs with solvable automorphism groups

A cubic graph $\Gamma$ is $G$-arc-transitive if $G\le \mathrm{Aut}\left(\Gamma \right)$ acts transitively on the set of arcs of $\Gamma$, and $G$-basic if $\Gamma$ is $G$-arc-transitive and $G$ has no non-trivial normal subgroup with more than two orbits. Let $G$ be a solvable group. In this paper, we first classify all connected $G$-basic cubic graphs and determine the group structure for every $G$. Then, combining covering techniques, we prove that a connected cubic $G$-arc-transitive graph is either a Cayley graph, or its full automorphism group is of type $2^2$, that is, a $2$-regular group with no involution reversing an edge, and has a non-abelian normal subgroup such that the corresponding quotient graph is the complete bipartite graph of order $6$.     

Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra

Let $A(G)$ and $D(G)$ be the adjacency matrix and the degree matrix of a graph $G$, respectively. The matrix $D(G)+A(G)$ is called the signless Laplacian matrix of $G$. The spectrum of the matrix $D(G)+A(G)$ is called the Q-spectrum of $G$. A graph is said to be determined by its Q-spectrum if there is no other non-isomorphic graph with the same Q-spectrum. In this paper, we prove that all starlike trees whose maximum degree exceed $4$ are determined by their Q-spectra.     

Solvable PST-groups,strong Sylow bases and mutually permutable products

A subgroup H of a group G is said to permute with the subgroup K of G if $HK=KH$. Subgroups H and K are mutually permutable (totally permutable) in G if every subgroup of H permutes with K and every subgroup of K permutes with H (if every subgroup of H permutes with every subgroup of K). If H and K are mutually permutable and $H\cap K=1$, then H and K are totally permutable. A subgroup H of G is S-permutable in G if H permutes with every Sylow subgroup of G. A group G is called a PST-group if S-permutability is a transitive relation in G. Let $\{p_1,\dots ,p_n,p_{n+1},\dots ,p_k\}$ be the set of prime divisors of the order of a finite group G with $\{p_1,\dots ,p_n\}$ the set of prime divisors of the order of the normal subgroup N of G. A set of Sylow subgroups $\{P_1,\dots ,P_n,P_{n+1},\dots ,P_k\}$, $P_i\in {\mathrm{Syl}}_{p_i}(G)$, form a strong Sylow system with respect to N if $P_i{P}_j$ is a mutually permutable product for all $i\in \{1,2,\dots ,n\}$ and $j\in \{1,2,\dots ,k\}$. We show that a finite group G is a solvable PST-group if and only if it has a normal subgroup N such that $G/N$ is nilpotent and G has a strong Sylow system with respect to N. It is also shown that G is a solvable PST-group if and only if G has a normal solvable PST-subgroup N and $G/N^{″}$ is a solvable PST-group.     

Degree Conditions and Degree Bounded Trees

In this paper, we give sufficient conditions for a graph to have degree bounded trees. Let G be a connected graph and $A\subseteq V(G)$. We denote by ${\sigma }_k(A)$ the minimum value of the degree sum in G of any k pairwise nonadjacent vertices of A, and by $w(G-A)$ the number of components of the subgraph $G-A$ of G induced by $V(G)-A$. Our main results are the following: (i) If ${\sigma }_k(A)⩾|G|-1$, then G contains a tree T with maximum degree ⩽k and $A\subseteq V(T)$. (ii) If ${\sigma }_{k-w(G-A)}(A)⩾|A|-1$, then G contains a spanning tree T with $d_T(x)⩽k$ for any $x\in A$. These are generalizations of the result by S. Win [S. Win, Existenz von Gerüsten mit Vorgeschriebenem Maximalgrad in Graphen, Abh. Math. Seminar Univ. Humburg 43 (1975) 263–267] and degree conditions are sharp.     

Boolean rings and reciprocal eigenvalue properties

Let A be the adjacency matrix of the zero-divisor graph $\mathrm{\Gamma }(R)$ of a finite commutative ring R containing nonzero zero-divisors. In this paper, it is shown that $\mathrm{\Gamma }(R)$ is the zero-divisor graph of a Boolean ring if and only if $\det (A)=-1$. Also, A is similar to plus or minus its inverse whenever R is a Boolean ring. As a consequence, it is proved that $\mathrm{\Gamma }(R)$ is the zero-divisor graph of a Boolean ring if and only if the set of eigenvalues (including multiplicities) of $\mathrm{\Gamma }(R)$ can be partitioned into 2-element subsets of the form $\{\lambda \text{,}\pm 1/\lambda \}$. Furthermore, any finite Boolean ring R is characterized by the degree and coefficients of the characteristic polynomial of A.     

Histories in Path Graphs

For a given graph G and a positive integer r the r-path graph, $P_r(G)$, has for vertices the set of all paths of length r in G. Two vertices are adjacent when the intersection of the corresponding paths forms a path of length $r-1$, and their union forms either a cycle or a path of length $r+1$ in G. Let $P_r^k(G)$ be the k-iteration of r-path graph operator on a connected graph G. Let H be a subgraph of $P_r^k(G)$. The k-history $P_r^{-k}(H)$ is a subgraph of G that is induced by all edges that take part in the recursive definition of H. We present some general properties of k-histories and give a complete characterization of graphs that are k-histories of vertices of 2-path graph operator.     

Rank,term rank and chromatic number of a graph

Let G be a graph with a nonempty edge set, we denote the rank of the adjacency matrix of G and the term rank of G, by $\mathrm{rk}(G)$ and $\mathrm{Rk}(G)$, respectively. It was conjectured [C. van Nuffelen, Amer. Math. Monthly 83 (1976) 265–266], for any graph G, $\chi (G)?\mathrm{rk}(G)$. The first counterexample to this conjecture was obtained by Alon and Seymour [J. Graph Theor. 13 (1989) 523–525]. Recently, Fishkind and Kotlov [Discrete Math. 250 (2002) 253–257] have proved that for any graph G, $\chi (G)?\mathrm{Rk}(G)$. In this Note we improve Fishkind–Kotlov upper bound and show that $\chi (G)?\frac{\mathrm{rk}(G)+\mathrm{Rk}(G)}{2}$. To cite this article: S. Akbari, H.-R. Fanaï, C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

Density of spaces of trigonometric polynomials with frequencies from a subgroup in Lα-spaces

Let G be an LCA group, H a closed subgroup, Γ the dual group of G and μ be a regular finite non-negative Borel measure on Γ. We give some necessary and sufficient conditions for the density of the set of trigonometric polynomials on Γ with frequencies from H in the space $L^{\alpha }(\mu ),\alpha \in (0,\infty )$.     

On Vertex Partitions and the Colin de Verdière Parameter

We study vertex partitions of graphs according to their Colin de Verdiere parameter μ. By a result of Ding et al. [DOSOO] we know that any graph G with $\mu (G)⩾2$ admits a vertex partition into two graphs with μ at most $\mu (G)-1$. Here we prove that any graph G with $\mu (G)⩾3$ admits a vertex partition into three graphs with μ at most $\mu (G)-2$. This study is extended to other minor-monotone graph parameters like the Hadwiger number.     

Extremal trees with given degree sequence for the Randić index

The Randi? index of a graph G is the sum of $((d(u))(d(v)){)}^{\alpha }$ over all edges $\mathit{uv}$ of G, where $d(v)$ denotes the degree of $v$ in G, $\alpha \ne 0$. When $\alpha =1$, it is the weight of a graph. Delorme, Favaron, and Rautenbach characterized the trees with a given degree sequence with maximum weight, where the question of finding the tree that minimizes the weight is left open. In this note, we characterize the extremal trees with given degree sequence for the Randi? index, thus answering the same question for weight. We also provide an algorithm to construct such trees.