English
Related papers

Related papers: A graph without zero in its spectra

200 papers

We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…

Mathematical Physics · Physics 2018-10-30 Pavel Exner , Aleksey Kostenko , Mark Malamud , Hagen Neidhardt

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…

Number Theory · Mathematics 2014-03-14 Mounir Hajli

We study the Laplacian on family preserving metric graphs. These are graphs that have a certain symmetry that, as we show, allows for a decomposition into a direct sum of one-dimensional operators whose properties are explicitly related to…

Spectral Theory · Mathematics 2020-02-19 Jonathan Breuer , Netanel Levi

The non-commuting graph of a non-abelian group $G$ with center $Z(G)$ is a simple undirected graph whose vertex set is $G\setminus Z(G)$ and two vertices $x, y$ are adjacent if $xy \ne yx$. In this study, we compute Signless Laplacian…

Group Theory · Mathematics 2023-04-03 Monalisha Sharma , Rajat Kanti Nath

Hodge Laplacians have been previously proposed as a natural tool for understanding higher-order interactions in networks and directed graphs. Here we introduce a Hodge-theoretic approach to spectral theory and dimensionality reduction for…

Algebraic Topology · Mathematics 2023-10-18 Hannah Santa Cruz Baur , Vladimir Itskov

In this paper we study spectral zeta functions associated to finite and infinite graphs. First we establish a meromorphic continuation of these functions under some general conditions. Then we study special values in the case of standard…

Spectral Theory · Mathematics 2019-09-05 Jérémy Dubout

We determine the asymptotic behaviour of the number of the Eulerian circuits in undirected simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). We also prove some new properties of the…

Combinatorics · Mathematics 2012-01-31 Mikhail Isaev

We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…

Spectral Theory · Mathematics 2019-09-18 Pavel Kurasov , Jonathan Rohleder

Let ${G}$ be a finite non-abelian group. The non-commuting conjugacy class graph (abbreviated as NCCC-graph) of $G$ is a simple undirected graph whose vertex set is the set of conjugacy classes of non-central elements of $G$ and two…

Combinatorics · Mathematics 2025-08-28 Rishabh Chakraborty , Firdous Ee Jannat , Rajat Kanti Nath

Let $M\circ N$ denote the Schur product of two matrices $M$ and $N$. A graph $X$ with adjacency matrix $A$ is walk regular if $A^k\circ I$ is a constant times $I$ for each $k\ge0$, and $X$ is 1-walk-regular if it is walk regular and…

Combinatorics · Mathematics 2025-01-28 Chris Godsil , Wanting Sun , Xiaohong Zhang

We give the spectral representation for a class of selfadjoint discrete graph Laplacians $\Delta$, with $\Delta$ depending on a chosen graph $G$ and a conductance function $c$ defined on the edges of $G$. We show that the spectral…

Mathematical Physics · Physics 2008-06-02 Dorin Ervin Dutkay , Palle E. T. Jorgensen

Lattice structures play a central role in spectral graph theory, offering analytical insight into diffusion, synchronization, and transport processes on regular discrete spaces. While their spectral properties are completely characterized…

Combinatorics · Mathematics 2025-11-17 Eleonora Andreotti

The zero-divisor graph $\Gamma(R)$ of a ring $R$ is a graph with nonzero zero-divisors of $R$ as vertices and distinct vertices $x,y$ are adjacent if $xy=0$ or $yx=0$. We provide an equivalence relation on a ring $R$ and express $\Gamma(R)$…

Spectral Theory · Mathematics 2022-04-01 Krishnat D. Masalkar , Anil Khairnar , Anita Lande , Avinash Patil

We consider a non self-adjoint Laplacian on a directed graph with non symmetric weights on edges. We give a criterion for the m-accretiveness and the m-sectoriality of this Laplacian. Our results are based on a comparison of this operator…

Spectral Theory · Mathematics 2019-06-19 Colette Anné , Marwa Balti , Nabila Torki-Hamza

We introduce a new operation on a class of graphs with the property that the Laplacian eigenvalues of the input and output graphs are related. Based on this operation, we obtain a family of order (square root of n) noncospectral unicyclic…

Combinatorics · Mathematics 2013-04-05 Eliseu Fritscher , Carlos Hoppen , Vilmar Trevisan

We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…

Mathematical Physics · Physics 2022-07-12 Marzieh Baradaran , Pavel Exner , Milos Tater

The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine…

Spectral Theory · Mathematics 2016-04-05 Pinchen Xie , Zhongzhi Zhang , Francesc Comellas

We consider Laplacians on periodic equilateral metric graphs. The spectrum of the Laplacian consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite number of flat…

Spectral Theory · Mathematics 2014-01-21 Evgeny Korotyaev , Natalia Saburova

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$.…

Combinatorics · Mathematics 2016-12-13 Qi Kong , Ligong Wang

We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…

Combinatorics · Mathematics 2015-11-12 Allana S. S. de Oliveira , Cybele T. M. Vinagre
‹ Prev 1 4 5 6 7 8 10 Next ›