Bounds for the signless laplacian energy

The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. The Laplacian (respectively, the signless Laplacian) energy of G is the sum of the absolute values of the differences between the eigenvalues of the Laplacian (respectively, signless Laplacian) matrix and the arithmetic mean of the vertex degrees of the graph. In this paper, among some results which relate these energies, we point out some bounds to them using the energy of the line graph of G. Most of these bounds are valid for both energies, Laplacian and signless Laplacian. However, we present two new upper bounds on the signless Laplacian which are not upper bounds for the Laplacian energy. © 2010 Elsevier Inc. All rights reserved.

Polinómios de Appell multidimensionais e sua representação matricial

Nesta dissertação é apresentada uma abordagem a polinómios de Appell multidimensionais dando-se especial relevância à estrutura da sua função geradora. Esta estrutura, conjugada com uma escolha adequada de ordenação dos monómios que figuram nos polinómios, confere um carácter unificador à abordagem e possibilita uma representação matricial de polinómios de Appell por meio de matrizes particionadas em blocos. Tais matrizes são construídas a partir de uma matriz de estrutura simples, designada matriz de criação, subdiagonal e cujas entradas não nulas são os sucessivos números naturais. A exponencial desta matriz é a conhecida matriz de Pascal, triangular inferior, onde figuram os números binomiais que fazem parte integrante dos coeficientes dos polinómios de Appell. Finalmente, aplica-se a abordagem apresentada a polinómios de Appell definidos no contexto da Análise de Clifford.

Numerical and combinatorial applications of generalized Appell polynomials

This thesis studies properties and applications of different generalized Appell polynomials in the framework of Clifford analysis. As an example of 3D-quasi-conformal mappings realized by generalized Appell polynomials, an analogue of the complex Joukowski transformation of order two is introduced. The consideration of a Pascal n-simplex with hypercomplex entries allows stressing the combinatorial relevance of hypercomplex Appell polynomials. The concept of totally regular variables and its relation to generalized Appell polynomials leads to the construction of new bases for the space of homogeneous holomorphic polynomials whose elements are all isomorphic to the integer powers of the complex variable. For this reason, such polynomials are called pseudo-complex powers (PCP). Different variants of them are subject of a detailed investigation. Special attention is paid to the numerical aspects of PCP. An efficient algorithm based on complex arithmetic is proposed for their implementation. In this context a brief survey on numerical methods for inverting Vandermonde matrices is presented and a modified algorithm is proposed which illustrates advantages of a special type of PCP. Finally, combinatorial applications of generalized Appell polynomials are emphasized. The explicit expression of the coefficients of a particular type of Appell polynomials and their relation to a Pascal simplex with hypercomplex entries are derived. The comparison of two types of 3D Appell polynomials leads to the detection of new trigonometric summation formulas and combinatorial identities of Riordan-Sofo type characterized by their expression in terms of central binomial coefficients.