Related papers: Spectral properties of general hypergraphs

We introduce a zeta function of digraphs that determines, and is determined by, the spectra of all linear combinations of the adjacency matrix, its transpose, the out-degree matrix, and the in-degree matrix. In particular, zeta-equivalence…

The rich spectral information of the graph Laplacian has been instrumental in graph theory, machine learning, and graph signal processing for applications such as graph classification, clustering, or eigenmode analysis. Recently, the Hodge…

In this paper, we give the spectrum of a matrix by using the quotient matrix, then we apply this result to various matrices associated to a graph and a digraph, including adjacency matrix, (signless) Laplacian matrix, distance matrix,…

We investigate spectral properties of Kirchhoff Laplacians on radially symmetric antitrees. This class of metric graphs enjoys a rich group of symmetries, which enables us to obtain a decomposition of the corresponding Laplacian into the…

We describe extensive computational experiments on spectral properties of random objects - random cubic graphs, random planar triangulations, and Voronoi and Delaunay diagrams of random (uniformly distributed) point sets on the sphere). We…

Let (M,g,J) be a compact Hermitian manifold with a smooth boundary. Let $\Delta_p$ and $D_p$ be the realizations of the real and complex Laplacians on p forms with either Dirichlet or Neumann boundary conditions. We generalize previous…

In this paper we will apply the tensor and its traces to investigate the spectral characterization of unicyclic graphs. Let $G$ be a graph and $G^m$ be the $m$-th power (hypergraph) of $G$. The spectrum of $G$ is referring to its adjacency…

Nonlinear spectral graph theory is an extension of the traditional (linear) spectral graph theory and studies relationships between spectral properties of nonlinear operators defined on a graph and topological properties of the graph…

A $k$-cyclic graph is a connected graph of order $n$ and size $n+k-1$. In this paper, we determine the maximal signless Laplacian spectral radius and the corresponding extremal graph among all $C_{4}$-free $k$-cyclic graphs of order $n$.…

Let $G$ be an irregular graph on $n$ vertices with maximum degree $\Delta$ and diameter $D$. We show that \Delta-\lambda_1>\frac{1}{nD} where $\lambda_1$ is the largest eigenvalue of the adjacency matrix of $G$. We also study the effect of…

Adjacency between two vertices in graphs or hypergraphs is a pairwise relationship. It is redefined in this article as 2-adjacency. In general hypergraphs, hyperedges hold for $n$-adic relationship. To keep the $n$-adic relationship the…

We construct a family of self-adjoint operators on the prime numbers whose entries depend on pairwise arithmetic divergences, replacing geometric distance with number-theoretic dissimilarity. The resulting spectra encode how coherence…

We address the Laplacian on a perturbed periodic graph which might not be a periodic graph. We present a class of perturbed graphs for which the essential spectra of the Laplacians are stable even when the graphs are perturbed by adding and…

The spectral properties of disordered fully-connected graphs with a special type of the node-node interactions are investigated. The approximate analytical expression for the ensemble-averaged spectral density for the Hamiltonian defined on…

The spectral theory of Laplacian tensor is an important tool for revealing some important properties of a hypergraph. It is meaningful to compute all Laplacian H-eigenvalues for some special $k$-uniform hypergraphs. For an odd-uniform loose…

Let $\Gamma=(G,\sigma)$ be a signed graph, where $\sigma$ is the sign function on the edges of $G$. In this paper, we use the operation of partial transpose to obtain non-isomorphic Laplacian cospectral signed graphs. We will introduce two…

On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…

In this work we perform a detailed statistical analysis of topological and spectral properties of random geometric graphs (RGGs); a graph model used to study the structure and dynamics of complex systems embedded in a two dimensional space.…

In this paper, we present an equitable partition theorem of tensors, which gives the relations between $H$-eigenvalues of a tensor and its quotient equitable tensor and extends the equitable partitions of graphs to hypergraphs. Furthermore,…

Let $k$ and $n$ be two nonnegative integers with $n\equiv0$ (mod 2), and let $G$ be a graph of order $n$ with a 1-factor. Then $G$ is said to be $k$-extendable for $0\leq k\leq\frac{n-2}{2}$ if every matching in $G$ of size $k$ can be…