We define the k-Fibonacci matrix as an extension of the classical Fibonacci matrix and relationed with the k-Fibonacci numbers. Then we give two factorizations of the Pascal matrix involving the k-Fibonacci matrix and two new matrices, L and R. As a consequence we find some combinatorial formulas involving the k-Fibonacci numbers.
The problem of distinguishing, in terms of graph topology, digraphs with real and partially non-real Laplacian spectra is important for applications. Motivated by the question posed in [R. Agaev, P. Chebotarev, Which digraphs with rings structure are essentially cyclic?, Adv. in Appl. Math. 45 (2010), 232-251], in this paper we completely list the Laplacian eigenvalues of some digraphs obtained from the wheel digraph by deleting some arcs.
The Laplacian spread of a graph is defined as the difference between the largest and second smallest eigenvalues of the Laplacian matrix of the graph. In this paper, bounds are obtained for the Laplacian spread of graphs. By the Laplacian spread, several upper bounds of the Nordhaus-Gaddum type of Laplacian eigenvalues are improved. Some operations on Laplacian spread are presented. Connected -cyclic graphs with vertices and Laplacian spread are discussed.
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n/2 ). In this paper we discuss the minimizing graphs of a special class of graphs of order n whose complements are connected and contains...
2000 Mathematics Subject Classification: 30A05, 33E05, 30G30, 30G35, 33E20.Let R0,2m+1 be the Clifford algebra of the antieuclidean 2m+1 dimensional space. The elliptic Cliffordian functions may be generated by the z2m+2 function, analogous to the well-known Weierstrass z-function. The latter satisfies a Legendre equality. We prove a corresponding formula at the level of the monogenic function Dm z2m+2.
We present a generalization of the method of the local relaxation flow to establish the universality of local spectral statistics of a broad class of large random matrices. We show that the local distribution of the eigenvalues coincides with the local statistics of the corresponding Gaussian ensemble provided the distribution of the individual matrix element is smooth and the eigenvalues {xj}j=1N are close to their classical location {γj}j=1N determined by the limiting density of eigenvalues. Under...
The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, M1, was understood fully (froma combinatorial perspective) by C.R. Johnson, A. Leal-Duarte (Linear Algebra and Multilinear Algebra 46 (1999) 139-144). Among the possible multiplicity lists for the eigenvalues of Hermitian matrices whose graph is a tree, we focus upon M2, the maximum value of the sum of the two largest multiplicities when the largest multiplicity is M1. Upper and lower bounds are given for M2. Using a combinatorial...