相关论文: On a Problem of Harary and Schwenk on Graphs with …

The utility of a matrix satisfying the Strong Spectral Property has been well established particularly in connection with the inverse eigenvalue problem for graphs. More recently the class of graphs in which all associated symmetric…

We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…

The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…

In this paper, we derive new relative perturbation bounds for eigenvectors and eigenvalues for regular quadratic eigenvalue problems of the form $\lambda^2 M x + \lambda C x + K x = 0$, where $M$ and $K$ are nonsingular Hermitian matrices…

Recent work shows that a new family of norms on Hermitian matrices arise by evaluating the even degree complete homogeneous symmetric (CHS) polynomials on the eigenvalues of a Hermitian matrix. The CHS norm of a graph is then defined by…

Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…

We address the problem of identifying families of discrete models naturally flowing in continuum limit to relativistic quantum field theories. We call them Dirac graphs. In this work, we require the graphs to obey spectrality property,…

In this paper, we investigate some relations between the invariants (including vertex and edge connectivity and forwarding indices) of a graph and its Laplacian eigenvalues. In addition, we present a sufficient condition for the existence…

The product of a Hermitian matrix and a positive semidefinite matrix has only real eigenvalues. We present bounds for sums of eigenvalues of such a product.

The eigenvalues of the Laplacian matrix for a class of directed graphs with both positive and negative weights are studied. First, a class of directed signed graphs is investigated in which one pair of nodes (either connected or not) is…

Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…

The fact that the adjacency matrix of every finite graph is diagonalizable plays a fundamental role in spectral graph theory. Since this fact does not hold in general for digraphs, it is natural to ask whether it holds for digraphs with…

The hierarchical product of two graphs represents a natural way to build a larger graph out of two smaller graphs with less regular and therefore more heterogeneous structure than the Cartesian product. Here we study the eigenvalue spectrum…

In this paper, we characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues of which one is equal to $1$, determine all connected bipartite graphs with at least one vertex of degree $1$ having exactly…

The classical Hermitian eigenvalue problem addresses the following question: What are the possible eigenvalues of the sum A+B of two Hermitian matrices A and B, provided we fix the eigenvalues of A and B. A systematic study of this problem…

Given a digraph D, the complementarity spectrum of the digraph is defined as the set of complementarity eigenvalues of its adjacency matrix. This complementarity spectrum has been shown to be useful in several fields, particularly in…

A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…

For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In…

We study the equivalence between bipartiteness and symmetry of spectra of mixed graphs, for $\theta$-Hermitian adjacency matrices defined by an angle $\theta \in (0, \pi]$. We show that this equivalence holds when, for example, an angle…