Maximal linear groups induced on the Frattini quotient of a p-group

Let $p>3$ be a prime. For each maximal subgroup $H?\mathrm{GL}(d,p)$ with $|H|?p^{3d+1}$, we construct a d-generator finite p-group G with the property that $\mathrm{Aut}(G)$ induces H on the Frattini quotient $G/\mathrm{\Phi }(G)$ and $|G|?p^{\frac{d^4}{2}}$. A significant feature of this construction is that $|G|$ is very small compared to $|H|$, shedding new light upon a celebrated result of Bryant and Kovács. The groups G that we exhibit have exponent p, and of all such groups G with the desired action of H on $G/\mathrm{\Phi }(G)$, the construction yields groups with smallest nilpotency class, and in most cases, the smallest order.     

Sharp bounds for the spectral radius of digraphs

Let $G=(V\text{,}E)$ be a digraph with n vertices and m arcs without loops and multiarcs. The spectral radius $\rho (G)$ of G is the largest eigenvalue of its adjacency matrix. In this paper, the following sharp bounds on $\rho (G)$ have been obtained.$\min \{\sqrt{t_i^{+}{t}_j^{+}}:(v_i\text{,}{v}_j)\in E\}?\rho (G)?\max \{\sqrt{t_i^{+}{t}_j^{+}}:(v_i\text{,}{v}_j)\in E\}$where G is strongly connected and $t_i^{+}$ is the average 2-outdegree of vertex $v_i$. Moreover, each equality holds if and only if G is average 2-outdegree regular or average 2-outdegree semiregular.     

ON f-EDGE COVER-COLOURING OF SIMPLE GRAPHS

An f-edge cover-colouring of a graph G = (V, E) is an assignment of colours to the edges of G such that every colour appears at each vertex υ∈ V at least f(υ) times.The maximum number of colours needed to f-edge cover colour G is called the f-edge cover chromatic index of G, denoted by χfc(G). This paper gives that min[d(ν)-1/f(ν)] ≤χfc(G) ≤min[d(υ)/f(υ)].     

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.     

Small-amplitude nonlinear waves on a black hole background

Let $G(x)$ be a $C^0$ function such that $|G(x)|⩽K{|x|}^p$ for $|x|⩽c$, for constants $K,c>0$. We consider spherically symmetric solutions of ${\square }_g\varphi =G(\varphi )$ where g is a Schwarzschild or more generally a Reissner–Nordström metric, and such that ϕ and ∇ϕ are compactly supported on a complete Cauchy surface. It is proven that for $p>4$, such solutions do not blow up in the domain of outer communications, provided the initial data are small. Moreover, $|\varphi |⩽C{(\max \{v,1\})}^{\mathrm{-1}}$, where v denotes an Eddington–Finkelstein advanced time coordinate.