Related papers: Zeta-equivalent digraphs: Simultaneous cospectrali…
This paper generalizes Bass' work on zeta functions for uniform tree lattices. Using the theory of von Neumann algebras, machinery is developed to define the zeta function of a discrete group of automorphisms of a bounded degree tree. The…
In a previous paper, we computed the spectrum of the singular Laplacian attached to canonical metrics on $\mathbb{P}^1$. In this article, we study $\zeta_\infty$, the Zeta function associated to this spectrum. We prove that it admits a…
The purpose of this paper is to investigate coefficient matrices of functional equations of zeta functions associated with homogeneous cones, which are given explicitly in the previous paper, in detail. We prove that the coefficient matrix…
This survey is two-fold. We first report new progress on the spectral extremal results on the Tur\'{a}n type problems in graph theory. More precisely, we shall summarize the spectral Tur\'{a}n function in terms of the adjacency spectral…
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in…
In this paper we consider two spectral realizations of the zeros of the Riemann zeta function. The first one involves all non-trivial (non-real) zeros and is expressed in terms of a Laplacian intimately related to the prolate wave operator.…
It is shown that an undirected graph $G$ is cospectral with the Hermitian adjacency matrix of a mixed graph $D$ obtained from a subgraph $H$ of $G$ by orienting some of its edges if and only if $H=G$ and $D$ is obtained from $G$ by a…
We study the spectral zeta functions of the Laplacian on fractal sets which are locally self-similar fractafolds, in the sense of Strichartz. These functions are known to meromorphically extend to the entire complex plane, and the locations…
Many variants of join operations of graphs have been introduced and their spectral properties have been studied extensively by many researchers. This paper mainly focuses on the Laplacian spectra of some double join operations of graphs. We…
We describe the complete spectra of Laplacian, signless Laplacian, and adjacency matrices associated with the commuting graphs of a finite group using group theoretic information. We provide a method to find the center of a group by only…
The author introduced models of linear logic known as ''Interaction Graphs'' which generalise Girard's various geometry of interaction constructions. In this work, we establish how these models essentially rely on a deep connection between…
We show that the zeta function of a regular graph admits a representation as a quotient of a determinant over a $L^2$-determinant of the combinatorial Laplacian.
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…
The universal adjacency matrix $U$ of a graph $\Gamma$, with adjacency matrix $A$, is a linear combination of $A$, the diagonal matrix $D$ of vertex degrees, the identity matrix $I$, and the all-1 matrix $J$ with real coefficients, that is,…
A rose graph is a graph consisting of cycles that all meet in one vertex. We show that except for two specific examples, these rose graphs are determined by the Laplacian spectrum, thus proving a conjecture posed by Lui and Huang [F.J. Liu…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
Let $G$ be a graph with adjacency matrix $A\left( G\right) $, and let $D\left( G\right) $ be the diagonal matrix of the degrees of $G.$ The signless Laplacian $Q\left( G\right) $ of $G$ is defined as $Q\left( G\right) :=A\left( G\right)…
A graph is said to be determined by its signless Laplacian spectrum (abbreviated as DQS) if no other non-isomorphic graph shares the same signless Laplacian spectrum. In this paper, we establish the following results: (1). Every graph of…
In this paper, we introduce central vertex corona, central edge corona, and central edge neighborhood corona of graphs using central graph. Also, we determine their adjacency spectrum, Laplacian spectrum and signless Laplacian spectrum.…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…