相关论文: Graphs and Hermitian matrices: discrepancy and sin…

We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…

Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…

Expository article on the problem of determining the maximum number of equiangular lines with a fixed angle, and the associated problem of second eigenvalue multiplicity in graphs.

We study the minimum number of distinct eigenvalues over a collection of matrices associated with a graph. Lower bounds are derived based on the existence or non-existence of certain cycle(s) in a graph. A key result proves that every…

Combined perturbation bounds are presented for eigenvalues and eigenspaces of Hermitian matrices or singular values and singular subspaces of general matrices. The bounds are derived based on the smooth decompositions and elementary…

In this paper, we establish several new inequalities for some twice differantiable mappings that are connected with the celebrated Hermite-Hadamard integral inequality. Some applications for special means of real numbers are also provided.

Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…

This paper offers a review of numerical methods for computation of the eigenvalues of Hermitian matrices and the singular values of general and some classes of structured matrices. The focus is on the main principles behind the methods that…

We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…

We review some convexity inequalities for Hermitian matrices an add one more to the list.

The $\alpha$-Hermitian adjacency matrix $H_\alpha$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number…

We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. Any surjective mapping $\phi:\Gamma\to\Gamma'$ between graphs from this class is shown to be an isomorphism provided that the following…

Let $A$ be a $n\times n$ complex Hermitian matrix and let $\lambda(A)=(\lambda_1,\ldots,\lambda_n)\in \mathbb{R}^n$ denote the eigenvalues of $A$, counting multiplicities and arranged in non-increasing order. Motivated by problems arising…

Spectral functions of symmetric matrices -- those depending on matrices only through their eigenvalues -- appear often in optimization. A cornerstone variational analytic tool for studying such functions is a formula relating their…

Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).

We investigate the statistical properties of eigenvalues of pseudo-Hermitian random matrices whose eigenvalues are real or complex conjugate. It is shown that when the spectrum splits into separated sets of real and complex conjugate…

We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the…

We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…

Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence…

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…