Inequalities for the median of the gamma distribution

We provide several new inequalities involving λ_n, the median of the gamma distribution of order n+1 with parameter 1. Among others, we present sharp upper and lower bounds for the arithmetic mean of λ₁,λ₂,…,λ_n. For all integers n?1 we have

     

Structural properties of Riordan matrices and extending the matrices

We consider an infinite lower triangular matrix L=[?_n,k]_n,k∈N0 and a sequence Ω=(ω_n)_n∈N0 called the (a,b)-sequence such that every element ?_n+1,k+1 except lying in column 0 can be expressed as

     

The boundary of higher rank numerical ranges

The rank-k-numerical range of an n×n matrix A is defined as

     

Note on the energy of regular graphs

For a simple graph G, the energy E(G) is defined as the sum of the absolute values of all the eigenvalues of its adjacency matrix A(G). Let n,m, respectively, be the number of vertices and edges of G. One well-known inequality is that , where λ₁ is the spectral radius. If G is k-regular, we have . Denote . Balakrishnan [R. Balakrishnan, The energy of a graph, Linear Algebra Appl. 387 (2004) 287-295] proved that for each ?>0, there exist infinitely many n for each of which there exists a k-regular graph G of order n with k<n-1 and , and proposed an open problem that, given a positive integer n?3, and ?>0, does there exist a k-regular graph G of order n such that . In this paper, we show that for each ?>0, there exist infinitely many such n that . Moreover, we construct another class of simpler graphs which also supports the first assertion that .     

When do linear combinations of orthogonal polynomials yield new sequences of orthogonal polynomials?

Given {P_n}_n≥0 a sequence of monic orthogonal polynomials, we analyze their linear combinations with constant coefficients and fixed length, i.e., 

     

Asymptotic properties of generalized Laguerre orthogonal polynomials

In the present paper we deal with the polynomials L_n^(α,M,N) (x) orthogonal with respect to the Sobolev inner product

     

On the Turán number for the hexagon

A long-standing conjecture of Erd?s and Simonovits is that ex(n,C_2k), the maximum number of edges in an n-vertex graph without a 2k-gon is asymptotically as n tends to infinity. This was known almost 40 years ago in the case of quadrilaterals. In this paper, we construct a counterexample to the conjecture in the case of hexagons. For infinitely many n, we prove that

     

Large matchings from eigenvalues

We find lower bounds on the difference between the spectral radius λ₁ and the average degree of an irregular graph G of order n and size e. In particular, we show that, if n ? 4, then

     

The Laplacian spectral radius of some bipartite graphs

In this paper, we study the largest Laplacian spectral radius of the bipartite graphs with n vertices and k cut edges and the bicyclic bipartite graphs, respectively. Identifying the center of a star K_1,k and one vertex of degree n of K_m,n, we denote by the resulting graph. We show that the graph (1?k?n-4) is the unique graph with the largest Laplacian spectral radius among the bipartite graphs with n vertices and k cut edges, and (n?7) is the unique graph with the largest Laplacian spectral radius among all the bicyclic bipartite graphs.     

Zeros of linear combinations of Laguerre polynomials from different sequences

We study interlacing properties of the zeros of two types of linear combinations of Laguerre polynomials with different parameters, namely and . Proofs and numerical counterexamples are given in situations where the zeros of R_n, and S_n, respectively, interlace (or do not in general) with the zeros of , , k=n or n−1. The results we prove hold for continuous, as well as integral, shifts of the parameter α.     

Characterization of graphs having extremal Randi? indices

The higher Randi? index R_t(G) of a simple graph G is defined as

     

Askey-Wilson relations and Leonard pairs

It is known that if (A,A^*) is a Leonard pair, then the linear transformations A, A^* satisfy the Askey-Wilson relations

     

Complete solution to a problem on the maximal energy of unicyclic bipartite graphs

The energy of a simple graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Denote by C_n the cycle, and the unicyclic graph obtained by connecting a vertex of C₆ with a leaf of P_n-6. Caporossi et al. conjectured that the unicyclic graph with maximal energy is for n=8,12,14 and n≥16. In Hou et al. (2002) [Y. Hou, I. Gutman, C. Woo, Unicyclic graphs with maximal energy, Linear Algebra Appl. 356 (2002) 27-36], the authors proved that is maximal within the class of the unicyclic bipartite n-vertex graphs differing from C_n. And they also claimed that the energies of C_n and is quasi-order incomparable and left this as an open problem. In this paper, by utilizing the Coulson integral formula and some knowledge of real analysis, especially by employing certain combinatorial techniques, we show that the energy of is greater than that of C_n for n=8,12,14 and n≥16, which completely solves this open problem and partially solves the above conjecture.     

A note on the kth eigenvalue of trees

In [Linear Algebra Appl. 149 (1991) 19-34], Shao proved that for a tree T on n vertices, the kth eigenvalue