Related papers: Defective eigenvalues of the non-backtracking matr…
Let $G = (V, E)$ be a graph. We define matrices $M(G; \alpha, \beta)$as $\alpha D + \beta A$, where $\alpha$, $\beta$ are real numbers such that $(\alpha, \beta) \neq (0, 0)$ and $D$ and $A$ are the diagonal matrix and adjacency matrix of…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
The Akbari-Cameron-Khosrovshahi (ACK) conjecture, which appears to be unresolved, states that for any simple graph $G$ with at least one edge, there exists a nonzero {$\{0,1\}$}-vector in the row space of its adjacency matrix that is not a…
Riordan matrices are infinite lower triangular matrices determined by a pair of formal power series over the real or complex field. These matrices have been mainly studied as combinatorial objects with an emphasis placed on the algebraic or…
This paper provides decay bounds for Green matrices and generalized eigenvectors of block Jacobi operators when the real part of the spectral parameter lies in a bounded gap of the operator's essential spectrum. The case of the spectral…
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…
It is known that in various random matrix models, large perturbations create outlier eigenvalues which lie, asymptotically, in the complement of the support of the limiting spectral density. This paper is concerned with fluctuations of…
In this article, we study Pareto eigenvalues of distance matrix of connected graphs and show that the non zero entries of every distance Pareto eigenvector of a tree forms a strictly convex function on the forest generated by the vertices…
We explore Jordan derivations of triangular matrices with entries from an additively idempotent semiring. The main result states that for any matrix A over additively idempotent semiring, if we put all the elements of the family of dense…
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
Three ways of constructing a non-Hermitian matrix with possible all real eigenvalues are discussed. They are PT symmetry, pseudo-Hermiticity, and generalized PT symmetry. Parameter counting is provided for each class. All three classes of…
A well-known characterization of Jordan vectors of a matrix polynomial $L(z)$ is generalized to a characterization of Jordan vectors of the operator-valued function $Q(z)$ at an eigenvalue $\alpha \in \mathbb{C}$. The results are then…
In July 2012, at the Conference on Applications of Graph Spectra in Computer Science, Barcelona, D. Stevanovic posed the following open problem: which graphs have the zero as the largest eigenvalue of their modularity matrix? The conjecture…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
This work presents conjectures about eigenvalues of matrices associated with $k$-path graphs, the algebraic connectivity, defined as the second smallest eigenvalue of the Laplacian matrix, and the $\alpha$-index, as the largest eigenvalue…
In this paper we consider the eigenvalues and the Seidel eigenvalues of a chain graph. An$\dbar$eli\'{c}, da Fonseca, Simi\'{c}, and Du \cite{andelic2020tridiagonal} conjectured that there do not exist non-isomorphic cospectral chain graphs…
We examine the adjacency matrices of three-regular graphs representing one-face maps. Numerical studies reveal that the limiting eigenvalue statistics of these matrices are the same as those of much larger, and more widely studied classes…
In this note we answer negatively to our conjecture concerning the deficiency indices. More precisely, given any non-negative integer $n$, there is locally finite graph on which the adjacency matrix has deficiency indices $(n,n)$.